Quickly deciding minor-closed parameters in generalgraphs

被引：7
|
作者：
Demaine, Erik D. [1 ]
Hajiaghayi, Mohammad Taghi [1 ]
机构：
[1] MIT, Comp Sci & Artificial Intelligence Lab, Cambridge, MA 02139 USA
来源：
EUROPEAN JOURNAL OF COMBINATORICS | 2007年 / 28卷 / 01期
关键词：
D O I：
10.1016/j.ejc.2005.07.003
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by N. Robertson, P.D. Seymour [Graph minors. XII. Distance on a surface, Journal of Combinatorial Theory, Series B 64 (2) (1995) 240-272; Graph minors. XX Wagner's conjecture, Journal of Combinatorial Theory, Series B 92 (2) (2004) 325-357], M. Frick, M. Grohe [Deciding first-order properties of locally tree-decomposable structures, Journal of the ACM 48 (6) (2001) 1184-1206], and M.R. Fellows, M.A. Langston [Nonconstructive tools for proving polynomial-time decidability, Journal of the ACM 35 (3) (1988) 727-739] toward obtaining fixed-parameter algorithms for a general class of parameters. (c) 2006 Published by Elsevier Ltd
引用
收藏
页码：311 / 314
页数：4
相关论文
共 50 条
  • [21] CHROMATIC ROOTS AND MINOR-CLOSED FAMILIES OF GRAPHS
    Perrett, Thomas
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2016, 30 (03) : 1883 - 1897
  • [22] Random Graphs from a Minor-Closed Class
    McDiarmid, Colin
    COMBINATORICS PROBABILITY & COMPUTING, 2009, 18 (04): : 583 - 599
  • [23] Reflections on and of minor-closed classes of multisorted operations
    Lehtonen, Erkko
    Poeschel, Reinhard
    Waldhauser, Tamas
    ALGEBRA UNIVERSALIS, 2018, 79 (03)
  • [24] The Highly Connected Matroids in Minor-Closed Classes
    Geelen, Jim
    Gerards, Bert
    Whittle, Geoff
    ANNALS OF COMBINATORICS, 2015, 19 (01) : 107 - 123
  • [25] Growth constants of minor-closed classes of graphs
    Bernardi, Olivier
    Noy, Marc
    Welsh, Dominic
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2010, 100 (05) : 468 - 484
  • [26] Diameter and treewidth in minor-closed graph families, revisited
    Demaine, ED
    Hajiaghayi, MT
    ALGORITHMICA, 2004, 40 (03) : 211 - 215
  • [27] Reconfiguring Dominating Sets in Minor-Closed Graph Classes
    Rautenbach, Dieter
    Redl, Johannes
    GRAPHS AND COMBINATORICS, 2021, 37 (06) : 2191 - 2205
  • [28] Logical limit laws for minor-closed classes of graphs
    Heinig, Peter
    Muller, Tobias
    Noy, Marc
    Taraz, Anusch
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2018, 130 : 158 - 206
  • [29] Density of Chromatic Roots in Minor-Closed Graph Families
    Perrett, Thomas J.
    Thomassen, Carsten
    COMBINATORICS PROBABILITY & COMPUTING, 2018, 27 (06): : 988 - 998
  • [30] Every minor-closed property of sparse graphs is testable
    Benjamini, Itai
    Schramm, Oded
    Shapira, Asaf
    ADVANCES IN MATHEMATICS, 2010, 223 (06) : 2200 - 2218
12345