Single step graph search problem

DOI10.1016/0020-0190(91)90018-DMaRDI QIDQ1183450zbMATH OpenFDO

Authors 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

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

Recommendations

• Solving the single step graph searching problem by solving the maximum two-independent set problem
• Three-fast-searchable graphs
• SOFSEM 2006: Theory and Practice of Computer Science
• Fast edge searching and fast searching on graphs
• The complexity of searching a graph

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3590298 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• The complexity of searching a graph

Cited in

(8)

• Single step searching in weighted block graphs
• An annotated bibliography on guaranteed graph searching
• Time constrained graph searching
• scientific article; zbMATH DE number 1471731 (Why is no real title available?)
• On the Cooperative Graph Searching Problem
• Solving the single step graph searching problem by solving the maximum two-independent set problem
• The summation and bottleneck minimization for single-step searching on weighted graphs
• Helicopter search problems, bandwidth and pathwidth

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1183450)