Connected graph searching
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3650583 (Why is no real title available?)
- scientific article; zbMATH DE number 4147519 (Why is no real title available?)
- scientific article; zbMATH DE number 176249 (Why is no real title available?)
- scientific article; zbMATH DE number 3590298 (Why is no real title available?)
- scientific article; zbMATH DE number 1775401 (Why is no real title available?)
- An annotated bibliography on guaranteed graph searching
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- BOUNDARY-OPTIMAL TRIANGULATION FLOODING
- Call routing and the ratcatcher
- Connected Graph Searching in Outerplanar Graphs
- Connected Treewidth and Connected Graph Searching
- Connected graph searching in chordal graphs
- Connected searching of weighted trees
- DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS
- Decontamination of hypercubes by mobile agents
- Distributed chasing of network intruders
- Eavesdropping games
- Expander graphs and their applications
- From pathwidth to connected pathwidth
- Generalized hypertree decompositions: NP-hardness and tractable variants
- Graph minors. X: Obstructions to tree-decomposition
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XX: Wagner's conjecture
- Graph searching with advice
- Interval graphs and searching
- Minimal acyclic forbidden minors for the family of graphs with bounded path-width
- Monotonicity in graph searching
- Monotony properties of connected visible graph searching
- Nonconstructive tools for proving polynomial-time decidability
- Nondeterministic graph searching: from pathwidth to treewidth
- On embedding trees into uniformly convex Banach spaces
- On the monotonicity of games generated by symmetric submodular functions.
- Parameterized and Exact Computation
- Pathwidth is NP-Hard for Weighted Trees
- Recontamination does not help to search a graph
- Searching and pebbling
- Searching is not jumping.
- Some mathematical properties of branching trees with application to the respiratory system
- Sweeping graphs with large clique number
- The complexity of searching a graph
- The cost of monotonicity in distributed graph searching
- The number of registers required for evaluating arithmetic expressions
Cited in
(32)- The search and the node-search number of dual graphs
- Gathering of robots in a ring with mobile faults
- Connected graph searching for unicyclic graphs
- Approximate search strategies for weighted trees
- Lower and upper competitive bounds for online directed graph exploration
- More agents may decrease global work: a case in butterfly decontamination
- scientific article; zbMATH DE number 7651203 (Why is no real title available?)
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph
- Exclusive graph searching vs. pathwidth
- Exclusive graph searching
- Distributed graph searching with a sense of direction
- Monotony Properties of Connected Visible Graph Searching
- Connected search for a lazy robber
- On the Cooperative Graph Searching Problem
- Network decontamination under \(m\)-immunity
- Connected graph searching in chordal graphs
- Connected surveillance game
- A linear fixed parameter tractable algorithm for connected pathwidth
- A connected version of the graph coloring game
- Monotonicity and inert fugitive search games
- Searching is not jumping.
- On-line search in two-dimensional environment
- Finding small-width connected path decompositions in polynomial time
- Exclusive graph searching
- Connected searching of weighted trees
- Branchwidth is \((1, g)\)-self-dual
- SOFSEM 2006: Theory and Practice of Computer Science
- Connected Treewidth and Connected Graph Searching
- On tradeoffs between width- and fill-like graph parameters
- Contraction obstructions for connected graph searching
- Monotony properties of connected visible graph searching
- Non-deterministic graph searching in trees
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)
