Search and sweep numbers of finite directed acyclic graphs

DOI10.1016/0166-218X(93)90242-GzbMath0777.05062MaRDI QIDQ1208460

Richard J. Nowakowski

Publication date: 16 May 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

directed acyclic graphssearch numbersweep number

Mathematics Subject Classification ID

Search theory (90B40) Games involving graphs (91A43) Directed graphs (digraphs), tournaments (05C20)

Related Items

An annotated bibliography on guaranteed graph searching, Monotonicity in digraph search problems, Standard directed search strategies and their applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Antichain cutsets
• A game of cops and robbers
• Searching and pebbling
• Vertex-to-vertex pursuit in a graph
• Combinatorial theory.
• A decomposition theorem for partially ordered sets
• Compact Spaces and Spaces of Maximal Complete Subgraphs
• Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
• The complexity of searching a graph