Arc Searching Digraphs Without Jumping

DOI10.1007/978-3-540-73556-4_37MaRDI QIDQ3611989zbMATH OpenOpenAlexFDO

Authors Brian Alspach, Danny Dyer, D. Hanson, Boting Yang

Publication date 3 March 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73556-4_37

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Positional games (pursuit and evasion, etc.) (91A24) Games involving graphs (91A43)

Recommendations

• Searching is not jumping.
• Digraph Strong Searching: Monotonicity and Complexity
• Monotonicity of strong searching on digraphs
• Three-fast-searchable graphs
• Standard directed search strategies and their applications

Cited in

(2)

• An annotated bibliography on guaranteed graph searching
• Monotonicity in digraph search problems

This page was built for publication: Arc Searching Digraphs Without Jumping

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