Monotony Properties of Connected Visible Graph Searching
From MaRDI portal
Publication:3522960
DOI10.1007/11917496_21zbMath1167.68407OpenAlexW2114999968MaRDI QIDQ3522960
Pierre Fraigniaud, Nicolas Nisse
Publication date: 4 September 2008
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11917496_21
Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
A polynomial time algorithm to compute the connected treewidth of a series-parallel graph ⋮ Contraction obstructions for connected graph searching ⋮ Monotonicity of Non-deterministic Graph Searching ⋮ Monotonicity of non-deterministic graph searching ⋮ An annotated bibliography on guaranteed graph searching ⋮ Monotony properties of connected visible graph searching
This page was built for publication: Monotony Properties of Connected Visible Graph Searching
