How to Use
Select graph:
- pw: Pathwidth
- Bags: Decomposition
- Search: Node search #
Node Search Number
pw(G) + 1 = node search number: minimum searchers to clear a contaminated graph. Place/remove searchers on vertices to 'clean' edges. Beautiful game-theoretic characterization of pathwidth.
pw vs tw
pw(G) ≥ tw(G) always. Can be much larger: pw(n×n grid) = n but tw(n×n grid) = n. For trees: pw = tw. Pathwidth measures 'path-likeness', treewidth measures 'tree-likeness'.
Step-by-Step Instructions
- 1Select graph.
- 2Compute pathwidth.
- 3Find decomposition.
- 4Compare to tw.
- 5Apply search game.