Thin graph classes and polynomial-time approximation schemes

zbMath1403.68159arXiv1704.00125MaRDI QIDQ4607999

Zdeněk Dvořák

Publication date: 15 March 2018

Full work available at URL: https://arxiv.org/abs/1704.00125

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25)

Related Items (1)

Layered separators in minor-closed graph classes with applications

This page was built for publication: Thin graph classes and polynomial-time approximation schemes