Connected graph searching
From MaRDI portal
Publication:690489
DOI10.1016/J.IC.2012.08.004zbMATH Open1252.91026OpenAlexW2053218689WikidataQ60488463 ScholiaQ60488463MaRDI QIDQ690489FDOQ690489
Authors: Lali Barrière, P. Flocchini, Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, N. Santoro, Dimitrios M. Thilikos 
Publication date: 27 November 2012
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2012.08.004
Recommendations
Cites Work
- Graph minors. X: Obstructions to tree-decomposition
- Graph minors. XX: Wagner's conjecture
- Graph searching with advice
- Call routing and the ratcatcher
- Searching and pebbling
- Graph minors. XIII: The disjoint paths problem
- Expander graphs and their applications
- Nonconstructive tools for proving polynomial-time decidability
- Eavesdropping games
- An annotated bibliography on guaranteed graph searching
- Generalized hypertree decompositions: NP-hardness and tractable variants
- Connected Treewidth and Connected Graph Searching
- Title not available (Why is that?)
- The complexity of searching a graph
- Recontamination does not help to search a graph
- Sweeping graphs with large clique number
- Minimal acyclic forbidden minors for the family of graphs with bounded path-width
- On the monotonicity of games generated by symmetric submodular functions.
- Monotonicity in graph searching
- Parameterized and Exact Computation
- Searching is not jumping.
- Monotony properties of connected visible graph searching
- On embedding trees into uniformly convex Banach spaces
- Interval graphs and searching
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Nondeterministic graph searching: from pathwidth to treewidth
- The cost of monotonicity in distributed graph searching
- Decontamination of hypercubes by mobile agents
- Title not available (Why is that?)
- Distributed chasing of network intruders
- Title not available (Why is that?)
- Title not available (Why is that?)
- The number of registers required for evaluating arithmetic expressions
- Some mathematical properties of branching trees with application to the respiratory system
- From pathwidth to connected pathwidth
- Connected Graph Searching in Outerplanar Graphs
- DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS
- Title not available (Why is that?)
- Pathwidth is NP-Hard for Weighted Trees
- BOUNDARY-OPTIMAL TRIANGULATION FLOODING
- Connected searching of weighted trees
- Connected graph searching in chordal graphs
Cited In (33)
- Monotony Properties of Connected Visible Graph Searching
- Non-deterministic graph searching in trees
- Connected searching of weighted trees
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph
- Distributed graph searching with a sense of direction
- Connected graph searching in chordal graphs
- Connected surveillance game
- On-line search in two-dimensional environment
- On tradeoffs between width- and fill-like graph parameters
- Gathering of robots in a ring with mobile faults
- The search and the node-search number of dual graphs
- A linear fixed parameter tractable algorithm for connected pathwidth
- Contraction obstructions for connected graph searching
- Approximate search strategies for weighted trees
- Searching by heterogeneous agents
- Finding small-width connected path decompositions in polynomial time
- Network decontamination under \(m\)-immunity
- Monotony properties of connected visible graph searching
- A connected version of the graph coloring game
- Title not available (Why is that?)
- Connected graph searching for unicyclic graphs
- Searching is not jumping.
- Monotonicity and inert fugitive search games
- Lower and upper competitive bounds for online directed graph exploration
- More agents may decrease global work: a case in butterfly decontamination
- Exclusive graph searching
- Connected search for a lazy robber
- On the Cooperative Graph Searching Problem
- SOFSEM 2006: Theory and Practice of Computer Science
- Connected Treewidth and Connected Graph Searching
- Exclusive graph searching
- Exclusive graph searching vs. pathwidth
- Branchwidth is \((1, g)\)-self-dual
This page was built for publication: Connected graph searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690489)
