Approximation algorithms for treewidth

Amir, E. (2010). Approximation algorithms for treewidth.

Type

Unclassified

Intellectual base

Unclassified

Year

2010

DOI

10.1007/s00453-008-9180-4

Link

https://doi.org/10.1007/s00453-008-9180-4

Cited by

1 citation across 1 artifact.

Domain-specific

• Treewidth
  • Equivalent characterizations use chordal completions, elimination orders, brambles and pursuit games; many otherwise intractable problems admit fixed-parameter or dynamic-programming algorithms on bounded-treewidth graphs.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:cc57b21a28ae · see in the full table