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 条
  • [31] Layered separators in minor-closed graph classes with applications
    Dujmovic, Vida
    Morin, Pat
    Wood, David R.
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2017, 127 : 111 - 147
  • [32] Every Minor-Closed Property of Sparse Graphs is Testable
    Benjamini, Itai
    Schramm, Oded
    Shapira, Asaf
    STOC'08: PROCEEDINGS OF THE 2008 ACM INTERNATIONAL SYMPOSIUM ON THEORY OF COMPUTING, 2008, : 393 - 402
  • [33] Assouad-Nagata dimension of minor-closed metrics
    Liu, Chun-Hung
    PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 2025, 130 (03)
  • [34] Distributed almost exact approximations for minor-closed families
    Czygrinow, Andrzej
    Hanckowiak, Michal
    ALGORITHMS - ESA 2006, PROCEEDINGS, 2006, 4168 : 244 - 255
  • [35] Quantum query complexity of minor-closed graph properties
    Childs, Andrew M.
    Kothari, Robin
    28TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2011), 2011, 9 : 661 - 672
  • [36] Random graphs from a weighted minor-closed class
    McDiarmid, Colin
    ELECTRONIC JOURNAL OF COMBINATORICS, 2013, 20 (02):
  • [37] MINOR-CLOSED GRAPH CLASSES WITH BOUNDED LAYERED PATHWIDTH
    Dujmovic, Vida
    Eppstein, David
    Joret, Gwenael
    Morin, Pat
    Wood, David R.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020, 34 (03) : 1693 - 1709
  • [38] Asymptotic Properties of Some Minor-Closed Classes of Graphs
    Bousquet-Melou, Mireille
    Weller, Kerstin
    COMBINATORICS PROBABILITY & COMPUTING, 2014, 23 (05): : 749 - 795
  • [39] Reconfiguring Dominating Sets in Minor-Closed Graph Classes
    Dieter Rautenbach
    Johannes Redl
    Graphs and Combinatorics, 2021, 37 : 2191 - 2205
  • [40] Packing minor-closed families of graphs into complete graphs
    Messuti, Silvia
    Rodl, Vojtech
    Schacht, Mathias
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2016, 119 : 245 - 265
12345