On temporal graph exploration
Reads0
Chats0
TLDR
In this article, it was shown that TEXP is NP-hard to approximate TEXP with ratio O( n 1 − e ) for every e > 0 and presented several solutions for special graph classes.About:
This article is published in Journal of Computer and System Sciences.The article was published on 2021-08-01 and is currently open access. It has received 34 citations till now. The article focuses on the topics: Exploration problem.read more
Citations
More filters
Posted Content
Deterministic Dispersion of Mobile Robots in Dynamic Rings
TL;DR: This work solves the problem of dispersion in presence of two types of dynamism in the underlying graph: (i) vertex permutation and (ii) 1-interval connectivity and presents impossibility results for dispersion when robots have no visibility.
Proceedings ArticleDOI
Delay-Robust Routes in Temporal Graphs
TL;DR: This work begins the study of the problem of itineraries that are robust to (small) delays by proving its NP-completeness as well as several hardness and tractability results for natural parameterizations.
Proceedings ArticleDOI
How fast can we reach a target vertex in stochastic temporal graphs
Eleni C. Akrida,George B. Mertzios,Sotiris Nikoletseas,Christoforos L. Raptopoulos,Paul G. Spirakis,Viktor Zamaraev +5 more
TL;DR: This paper investigates the complexity of two naturally related, but fundamentally different, temporal path (journey) problems: MINIMUM ARRIVAL and BEST POLICY and investigates the computational landscape of both problems for the different values of memory $k.
Proceedings ArticleDOI
The Complexity of Temporal Vertex Cover in Small-Degree Graphs
TL;DR: The main result shows that for every Delta geq 2, Delta-TVC is NP-hard even when the underlying topology is described by a path or a cycle, and presents a number of exact and approximation algorithms for temporal graphs whose underlying topologies are given by a Path, that have bounded vertex degree in every time step, or that admit a small-sized temporal vertex cover.
Proceedings ArticleDOI
Temporal Connectivity: Coping with Foreseen and Unforeseen Delays
TL;DR: This work gives polynomial-time algorithms for the two extreme cases: delays known before departure and delays occurring without prior warning (the latter leading to a two-player game scenario).
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
Graph Theory
TL;DR: Gaph Teory Fourth Edition is standard textbook of modern graph theory which covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each chapter by one or two deeper results.
Book
Distributed algorithms
TL;DR: This book familiarizes readers with important problems, algorithms, and impossibility results in the area, and teaches readers how to reason carefully about distributed algorithms-to model them formally, devise precise specifications for their required behavior, prove their correctness, and evaluate their performance with realistic measures.
Journal ArticleDOI
A Separator Theorem for Planar Graphs
TL;DR: In this paper, it was shown that the vertices of a planar graph can be partitioned into three sets A, B, C such that no edge joins a vertex in A with another vertex in B, neither A nor B contains more than ${2n/3}$ vertices, and C contains no more than $2.
Journal ArticleDOI
A Distributed Algorithm for Minimum-Weight Spanning Trees
TL;DR: A distributed algorithm is presented that constructs the minimum weight spanning tree in a connected undirected graph with distinct edge weights that can be initiated spontaneously at any node or at any subset of nodes.