Efficient exploration of faulty trees

DOI10.1007/s00224-005-1252-0zbMath1109.68130OpenAlexW1996317753MaRDI QIDQ870447

Euripides Markou, Andrzej Pelc

Publication date: 12 March 2007

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-005-1252-0

zbMATH Keywords

exploration algorithm

Mathematics Subject Classification ID

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

Related Items (2)

Fault-tolerant sequential scan ⋮ Exploration of Faulty Hamiltonian Graphs

This page was built for publication: Efficient exploration of faulty trees