Pages that link to "Item:Q672094"

The following pages link to A simple linear-time algorithm for finding path-decompositions of small width (Q672094):

Displayed 2 items.

• A partial k-arboretum of graphs with bounded treewidth (Q1274912) ‎ (← links)
• On computing graph minor obstruction sets (Q1575945) ‎ (← links)