On Temporally Connected Graphs of Small Cost
From MaRDI portal
Publication:2788993
DOI10.1007/978-3-319-28684-6_8zbMath1379.68249OpenAlexW828737876MaRDI 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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
The complexity of optimal design of temporally connected graphs ⋮ Temporal flows in temporal networks ⋮ The Complexity of Finding Small Separators in Temporal Graphs
This page was built for publication: On Temporally Connected Graphs of Small Cost
