scientific article; zbMATH DE number 1303571

zbMath0942.68089MaRDI QIDQ4250197

Petrişor Panaite, Andrzej Pelc

Publication date: 17 June 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

exploration algorithmsundirected connected graph

Mathematics Subject Classification ID

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

Related Items (11)

Beyond Rings: Gathering in 1-Interval Connected Graphs ⋮ How many ants does it take to find the food? ⋮ On the Power of Local Orientations ⋮ Exploring an unknown graph ⋮ Searching with mobile agents in networks with liars. ⋮ A tight lower bound for semi-synchronous collaborative grid exploration ⋮ Assigning labels in an unknown anonymous network with a leader ⋮ Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory ⋮ Graph exploration with robot swarms ⋮ A tight lower bound for semi-synchronous collaborative grid exploration ⋮ The power of a pebble: Exploring and mapping directed graphs

This page was built for publication: