On temporal graph exploration

DOI10.1007/978-3-662-47672-7_36MaRDI QIDQ6828696zbMATH OpenFDO

Authors Thomas Erlebach, Frank Kammer

Publication date 27 October 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://figshare.com/articles/conference_contribution/On_Temporal_Graph_Exploration/10181417

zbMATH Keywords

bounded treewidthinapproximabilityirregularly present edgesplanar graphsregularly present edges

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Cited in

(6)

• Broadcasting with mobile agents in dynamic networks
• Cops \& Robber on periodic temporal graphs
• On the broadcast problem for mobile agents in dynamic networks
• Path connected dynamic graphs with a study of dispersion and exploration
• The complexity of transitively orienting temporal graphs
• Exploration on highly dynamic graphs

This page was built for publication: On temporal graph exploration

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