The following pages link to Algorithms – ESA 2004 (Q5464620):
Displaying 9 items.
- \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions (Q516870) (← links)
- Treewidth computations. II. Lower bounds (Q549673) (← links)
- Achievable sets, brambles, and sparse treewidth obstructions (Q881587) (← links)
- Treewidth lower bounds with brambles (Q926284) (← links)
- The complexity of degree anonymization by graph contractions (Q2407102) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- An Experimental Study of the Treewidth of Real-World Graph Data (Q5091123) (← links)
- Contraction and Treewidth Lower Bounds (Q5301380) (← links)
- Searching for a Visible, Lazy Fugitive (Q5302068) (← links)