Pages that link to "Item:Q3525783"
From MaRDI portal
The following pages link to Connected Treewidth and Connected Graph Searching (Q3525783):
Displayed 23 items.
- On computational complexity of graph inference from counting (Q269786) (← links)
- Tree projections and structural decomposition methods: minimality and game-theoretic characterization (Q393903) (← links)
- Connected graph searching (Q690489) (← links)
- Connected searching of weighted trees (Q719311) (← links)
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Distributed chasing of network intruders (Q930899) (← links)
- Connected graph searching in chordal graphs (Q967304) (← links)
- Monotony properties of connected visible graph searching (Q999260) (← links)
- Graph searching with advice (Q1008727) (← links)
- Sweeping graphs with large clique number (Q1045071) (← links)
- Combining restarts, nogoods and bag-connected decompositions for solving csps (Q1706771) (← links)
- On tradeoffs between width- and fill-like graph parameters (Q1999998) (← links)
- Contiguous search problem in Sierpiński graphs (Q2272196) (← links)
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- The cost of monotonicity in distributed graph searching (Q2377133) (← links)
- Tree Projections: Game Characterization and Computational Aspects (Q3655155) (← links)
- Network Decontamination with Temporal Immunity by Cellular Automata (Q4931220) (← links)
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems (Q5283239) (← links)
- Bounding Connected Tree-Width (Q5741084) (← links)
- Approximate Turing Kernelization for Problems Parameterized by Treewidth (Q5874531) (← links)
- Approximating Pathwidth for Graphs of Small Treewidth (Q6075751) (← links)
- Connected search for a lazy robber (Q6080862) (← links)