works on
fixed-parameter tractability 1graph algorithms 1graph parameters 1outer k-planar graphs 1parameterized complexity 1

From the 1 of 10 linked papers with an AI index.

collaborators
Showing math.COShow all

1 paper · 1 filter

math.CO2026

Trade-off between spread and width for tree decompositions

Hans L. Bodlaender, Carla Groenland

We study the trade-off between (average) spread and width in tree decompositions, answering several questions from Wood [arXiv:2509.01140]. The spread of a vertex in a tree dec…