Algorithms – ESA 2005

DOI10.1007/11561071zbMath1162.68493OpenAlexW2501059503MaRDI QIDQ5475814

Rudolf Fleischer, Gerhard Trippen

Publication date: 27 June 2006

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

Full work available at URL: https://doi.org/10.1007/11561071

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (21)

An improved lower bound for competitive graph exploration ⋮ Lower and upper competitive bounds for online directed graph exploration ⋮ Computing without communicating: ring exploration by asynchronous oblivious robots ⋮ Online graph exploration on trees, unicyclic graphs and cactus graphs ⋮ Online graph exploration: New results on old and new algorithms ⋮ Exploration of Time-Varying Connected Graphs with Silent Agents ⋮ Graph covering using bounded size subgraphs ⋮ Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs ⋮ Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots ⋮ Deterministic network exploration by a single agent with Byzantine tokens ⋮ Fast periodic graph exploration with constant memory ⋮ Setting port numbers for fast graph exploration ⋮ Online Graph Exploration: New Results on Old and New Algorithms ⋮ Tree exploration with advice ⋮ Online graph exploration algorithms for cycles and trees by multiple searchers ⋮ Remembering without memory: tree exploration by asynchronous oblivious robots ⋮ Weighted nearest neighbor algorithms for the graph exploration problem on cycles ⋮ Time versus cost tradeoffs for deterministic rendezvous in networks ⋮ Connected reconfiguration of lattice-based cellular structures by finite-memory robots ⋮ More Efficient Periodic Traversal in Anonymous Undirected Graphs ⋮ Exploring sparse graphs with advice

This page was built for publication: Algorithms – ESA 2005