Digraph Strong Searching: Monotonicity and Complexity

DOI10.1007/978-3-540-72870-2_4zbMath1137.68506OpenAlexW1550403096MaRDI QIDQ5434421

Yi Cao, Boting Yang

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)

Related Items

On the monotonicity of process number ⋮ Digraph Decompositions and Monotonicity in Digraph Searching ⋮ Digraph decompositions and monotonicity in digraph searching ⋮ An annotated bibliography on guaranteed graph searching ⋮ Digraph searching, directed vertex separation and directed pathwidth