Pages that link to "Item:Q1024783"
From MaRDI portal
The following pages link to Nondeterministic graph searching: from pathwidth to treewidth (Q1024783):
Displayed 9 items.
- Jumping robbers in digraphs (Q343927) (← links)
- Characterizing width two for variants of treewidth (Q344827) (← links)
- Connected graph searching (Q690489) (← links)
- Cooperative exploration and protection of a workspace assisted by information networks (Q2248545) (← links)
- Non-deterministic graph searching in trees (Q2344776) (← links)
- A distributed algorithm for computing the node search number in trees (Q2429351) (← links)
- Constructing Brambles (Q3182927) (← links)
- Edge Search Number of Cographs in Linear Time (Q5321690) (← links)
- Connected search for a lazy robber (Q6080862) (← links)