Digraph Strong Searching: Monotonicity and Complexity

DOI10.1007/978-3-540-72870-2_4MaRDI QIDQ5434421zbMATH OpenOpenAlexFDO

Authors Boting Yang, Yi Cao

Publication date 4 January 2008

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72870-2_4

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Monotonicity of strong searching on digraphs
• Digraph decompositions and monotonicity in digraph searching
• Digraph Decompositions and Monotonicity in Digraph Searching
• Directed Searching Digraphs: Monotonicity and Complexity
• Monotonicity in digraph search problems
• Directed path-width and monotonicity in digraph searching
• Monotonicity in graph searching
• Monotonicity of Non-deterministic Graph Searching
• Monotonicity of non-deterministic graph searching
• On the Monotonicity of Weak Searching

Cited in

(10)

• Monotonicity of strong searching on digraphs
• On the monotonicity of process number
• On the Monotonicity of Weak Searching
• Arc Searching Digraphs Without Jumping
• Digraph Decompositions and Monotonicity in Digraph Searching
• Directed Searching Digraphs: Monotonicity and Complexity
• Digraph decompositions and monotonicity in digraph searching
• An annotated bibliography on guaranteed graph searching
• Digraph searching, directed vertex separation and directed pathwidth
• Monotonicity in digraph search problems

This page was built for publication: Digraph Strong Searching: Monotonicity and Complexity

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