The following pages link to Connected graph searching (Q690489):
Displaying 21 items.
- Contraction obstructions for connected graph searching (Q298950) (← links)
- Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
- More agents may decrease global work: a case in butterfly decontamination (Q343925) (← links)
- Exclusive graph searching (Q521823) (← links)
- Connected searching of weighted trees (Q719311) (← links)
- Exclusive graph searching vs. pathwidth (Q729824) (← links)
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866) (← links)
- Network decontamination under \(m\)-immunity (Q908298) (← links)
- Gathering of robots in a ring with mobile faults (Q1731510) (← links)
- Approximate search strategies for weighted trees (Q1929222) (← links)
- On tradeoffs between width- and fill-like graph parameters (Q1999998) (← links)
- A connected version of the graph coloring game (Q2192130) (← links)
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- Non-deterministic graph searching in trees (Q2344776) (← links)
- Distributed graph searching with a sense of direction (Q2355324) (← links)
- A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth (Q5062107) (← links)
- (Q5874536) (← links)
- Searching by heterogeneous agents (Q5918998) (← links)
- On-line search in two-dimensional environment (Q5919296) (← links)
- Connected search for a lazy robber (Q6080862) (← links)
- Branchwidth is \((1, g)\)-self-dual (Q6126712) (← links)
