Please use this identifier to cite or link to this item: http://hdl.handle.net/2381/32123
 Title: On Temporal Graph Exploration Authors: Erlebach, ThomasHoffmann, MichaelKammer, F. First Published: 20-Jun-2015 Presented at: ICALP, Kyoto Start Date: 6-Jul-2015 End Date: 10-Jul-2015 Publisher: Springer Berlin Heidelberg Citation: Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science Volume 9134, 2015, pp. 444-455 (12) Abstract: A temporal graph is a graph in which the edge set can change from step to step. The temporal graph exploration problem TEXP is the problem of computing a foremost exploration schedule for a temporal graph, i.e., a temporal walk that starts at a given start node, visits all nodes of the graph, and has the smallest arrival time. We consider only temporal graphs that are connected at each step. For such temporal graphs with $n$ nodes, we show that it is $\NP$-hard to approximate TEXP with ratio $O(n^{1-\epsilon})$ for any $\epsilon>0$. We also provide an explicit construction of temporal graphs that require $\Theta(n^2)$ steps to be explored. We then consider TEXP under the assumption that the underlying graph (i.e. the graph that contains all edges that are present in the temporal graph in at least one step) belongs to a specific class of graphs. Among other results, we show that temporal graphs can be explored in $O(n^{1.5}k^2\log n)$ steps if the underlying graph has treewidth $k$ and in $O(n\log^3 n)$ steps if the underlying graph is a $2\times n$ grid. Finally, we show that sparse temporal graphs with regularly present edges can always be explored in $O(n)$ steps. DOI Link: 10.1007/978-3-662-47672-7_36 ISSN: 0302-9743 ISBN: 978-3-662-47671-0 Links: http://hdl.handle.net/2381/32123http://link.springer.com/chapter/10.1007/978-3-662-47672-7_36 Version: Post-print Status: Peer-reviewed Type: Conference Paper Rights: The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-47672-7_36 Appears in Collections: Conference Papers & Presentations, Dept. of Computer Science

Files in This Item:
File Description SizeFormat
icalp15_lra.pdfPost-review (final submitted)323.22 kBAdobe PDF

Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.6361634135246277, "perplexity": 1114.5130760774102}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2018-51/segments/1544376826856.91/warc/CC-MAIN-20181215131038-20181215153038-00518.warc.gz"}