Algorithms and Computation

DOI10.1007/b104582zbMath1116.05314OpenAlexW2491382297MaRDI QIDQ5712176

Danny Dyer, Brian Alspach, Boting Yang

Publication date: 22 December 2005

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

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

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (11)

The cost of monotonicity in distributed graph searching ⋮ Monotonicity of Non-deterministic Graph Searching ⋮ Monotonicity of non-deterministic graph searching ⋮ An annotated bibliography on guaranteed graph searching ⋮ Distributed chasing of network intruders ⋮ Connected graph searching in chordal graphs ⋮ Contiguous search problem in Sierpiński graphs ⋮ Monotony properties of connected visible graph searching ⋮ Graph searching with advice ⋮ Standard directed search strategies and their applications ⋮ Sweeping graphs with large clique number

This page was built for publication: Algorithms and Computation