Graph Searching with Advice

DOI10.1007/978-3-540-72951-8_6MaRDI QIDQ5425960zbMATH OpenOpenAlexFDO

Authors Nicolas Nisse, David Soguet

Publication date 15 November 2007

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72951-8_6

zbMATH Keywords

monotonicitygraph searchingbits of advice

Mathematics Subject Classification ID

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

Recommendations

• Graph searching with advice
• Online graph exploration with advice
• Exploring sparse graphs with advice
• Search in graphs
• Deterministic graph exploration with advice
• Deterministic Graph Exploration with Advice
• scientific article; zbMATH DE number 1538872
• Search problems on graphs
• Exploring sparse graphs with advice (extended abstract)
• scientific article; zbMATH DE number 2233648

Cited in

(13)

• The cost of monotonicity in distributed graph searching
• Online computation with advice
• Trade-offs between the size of advice and broadcasting time in trees
• Deterministic Graph Exploration with Advice
• An annotated bibliography on guaranteed graph searching
• Graph searching with advice
• Tree exploration with advice
• Fast radio broadcasting with advice
• Communication algorithms with advice
• Distributed computing with advice: information sensitivity of graph coloring
• Local Maps: New Insights into Mobile Agent Algorithms
• Distributed chasing of network intruders
• Fast Radio Broadcasting with Advice

This page was built for publication: Graph Searching with Advice

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