Directed Searching Digraphs: Monotonicity and Complexity

DOI10.1007/978-3-540-72504-6_12zbMath1198.68231OpenAlexW1551017015MaRDI QIDQ5425427

Boting Yang, Yi Cao

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72504-6_12

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

An annotated bibliography on guaranteed graph searching ⋮ Digraph searching, directed vertex separation and directed pathwidth

This page was built for publication: Directed Searching Digraphs: Monotonicity and Complexity