Monotony properties of connected visible graph searching
From MaRDI portal
Publication:999260
DOI10.1016/J.IC.2008.09.002zbMATH Open1152.91383OpenAlexW2139957765MaRDI QIDQ999260FDOQ999260
Authors: Pierre Fraigniaud, Nicolas Nisse 
Publication date: 3 February 2009
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2008.09.002
Recommendations
Cites Work
- Graph searching and a min-max theorem for tree-width
- A partial k-arboretum of graphs with bounded treewidth
- Searching and pebbling
- An annotated bibliography on guaranteed graph searching
- Connected Treewidth and Connected Graph Searching
- Graph minors. II. Algorithmic aspects of tree-width
- The complexity of searching a graph
- Recontamination does not help to search a graph
- The vertex separation and search number of a graph
- Fugitive-search games on graphs and related parameters
- Monotony Properties of Connected Visible Graph Searching
- Monotonicity in graph searching
- Searching is not jumping.
- Title not available (Why is that?)
- Mathematical Foundations of Computer Science 2005
- Algorithms and Computation
Cited In (13)
- Step-wise tile assembly with a constant number of tile types
- Monotony Properties of Connected Visible Graph Searching
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph
- Connected graph searching in chordal graphs
- The cost of monotonicity in distributed graph searching
- On the monotonicity of process number
- Searching by heterogeneous agents
- Connected graph searching
- Finding small-width connected path decompositions in polynomial time
- A connected version of the graph coloring game
- Combinatorial trace method for network immunization
- Jumping robbers in digraphs
- Connected search for a lazy robber
This page was built for publication: Monotony properties of connected visible graph searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q999260)
