Uloženo v:
| Hlavní autoři: | , , |
|---|---|
| Médium: | Preprint |
| Vydáno: |
2020
|
| Témata: | |
| On-line přístup: | https://arxiv.org/abs/2007.02413 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| _version_ | 1866917388019040256 |
|---|---|
| author | Lindermayr, Alexander Siebertz, Sebastian Vigny, Alexandre |
| author_facet | Lindermayr, Alexander Siebertz, Sebastian Vigny, Alexandre |
| contents | We study the graph parameter elimination distance to bounded degree, which was introduced by Bulian and Dawar in their study of the parameterized complexity of the graph isomorphism problem. We prove that the problem is fixed-parameter tractable on planar graphs, that is, there exists an algorithm that given a planar graph $G$ and integers $d$ and $k$ decides in time $f(k,d)\cdot n^c$ for a computable function~$f$ and constant $c$ whether the elimination distance of $G$ to the class of degree $d$ graphs is at most $k$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2007_02413 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | Elimination distance to bounded degree on planar graphs Lindermayr, Alexander Siebertz, Sebastian Vigny, Alexandre Discrete Mathematics Combinatorics We study the graph parameter elimination distance to bounded degree, which was introduced by Bulian and Dawar in their study of the parameterized complexity of the graph isomorphism problem. We prove that the problem is fixed-parameter tractable on planar graphs, that is, there exists an algorithm that given a planar graph $G$ and integers $d$ and $k$ decides in time $f(k,d)\cdot n^c$ for a computable function~$f$ and constant $c$ whether the elimination distance of $G$ to the class of degree $d$ graphs is at most $k$. |
| title | Elimination distance to bounded degree on planar graphs |
| topic | Discrete Mathematics Combinatorics |
| url | https://arxiv.org/abs/2007.02413 |