Single step graph search problem

DOI10.1016/0020-0190(91)90018-DzbMath0748.68043MaRDI QIDQ1183450

Ruay-Shiung Chang

Publication date: 28 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

interval graphgraph search problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Single step searching in weighted block graphs ⋮ Helicopter search problems, bandwidth and pathwidth ⋮ Unnamed Item ⋮ Time constrained graph searching ⋮ An annotated bibliography on guaranteed graph searching ⋮ The summation and bottleneck minimization for single-step searching on weighted graphs

Cites Work

• The complexity of searching a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Single step graph search problem