Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs

Erik D Demaine, F. V. F., Hajiaghayi, M., & Thilikos, D. M. (2005). Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. ACM.

Type

Unclassified

Intellectual base

Unclassified

Year

2005

DOI

10.1145/1101821.1101823

Link

https://doi.org/10.1145/1101821.1101823

Cited by

1 citation across 1 artifact.

Domain-specific

• Bidimensionality
  • Bidimensionality theory combines graph-minor structure with a parameter's monotonicity and grid growth to obtain treewidth bounds, approximation schemes, kernels, and fixed-parameter algorithms on sparse graph classes.

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:4f6641a3b580 · see in the full table