Pages that link to "Item:Q5902509"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5902509):
Displayed 25 items.
- Contraction obstructions for connected graph searching (Q298950) (← links)
- More agents may decrease global work: a case in butterfly decontamination (Q343925) (← links)
- Connected graph searching (Q690489) (← links)
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866) (← links)
- Network decontamination under \(m\)-immunity (Q908298) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Distributed chasing of network intruders (Q930899) (← links)
- Monotonicity in digraph search problems (Q955030) (← links)
- Connected graph searching in chordal graphs (Q967304) (← links)
- A graph search algorithm for indoor pursuit/evasion (Q970034) (← links)
- CSP duality and trees of bounded pathwidth (Q986555) (← links)
- Monotony properties of connected visible graph searching (Q999260) (← links)
- Graph searching with advice (Q1008727) (← links)
- Edge searching weighted graphs (Q1026157) (← links)
- Sweeping graphs with large clique number (Q1045071) (← links)
- Approximate search strategies for weighted trees (Q1929222) (← links)
- Distributed graph searching with a sense of direction (Q2355324) (← links)
- The cost of monotonicity in distributed graph searching (Q2377133) (← links)
- A distributed algorithm for computing the node search number in trees (Q2429351) (← links)
- Three-fast-searchable graphs (Q2446838) (← links)
- Connected Graph Searching in Outerplanar Graphs (Q3439336) (← links)
- A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth (Q5062107) (← links)
- Integer programming models and algorithms for the graph decontamination problem with mobile agents (Q5326775) (← links)
- (Q5874536) (← links)
- Connected search for a lazy robber (Q6080862) (← links)