On Temporally Connected Graphs of Small Cost
From MaRDI portal
Publication:2788993
DOI10.1007/978-3-319-28684-6_8zbMath1379.68249MaRDI QIDQ2788993
George B. Mertzios, Eleni C. Akrida, Paul G. Spirakis, Leszek Gąsieniec
Publication date: 26 February 2016
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: http://dro.dur.ac.uk/16558/1/16558.pdf
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
The complexity of optimal design of temporally connected graphs, Temporal flows in temporal networks