Faster exploration of some temporal graphs

DOI10.4230/LIPICS.SAND.2022.5MaRDI QIDQ7395540zbMATH OpenFDO

Authors Duncan Adamson, Vladimir V. Gusev, D. S. Malyshev, Victor Zamaraev

Publication date 2022

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SAND.2022.5

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites work

• Exploration of \(k\)-edge-deficient temporal graphs
• Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
• On exploring always-connected temporal graphs of small pathwidth
• On temporal graph exploration
• The temporal explorer who returns to the base
• Traveling salesman problems in temporal graphs
• Two moves per time step make a difference

This page was built for publication: Faster exploration of some temporal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7395540)