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 条
  • [41] QUANTUM QUERY COMPLEXITY OF MINOR-CLOSED GRAPH PROPERTIES
    Childs, Andrew M.
    Kothari, Robin
    SIAM JOURNAL ON COMPUTING, 2012, 41 (06) : 1426 - 1450
  • [42] On minor-closed classes of matroids with exponential growth rate
    Geelen, Jim
    Nelson, Peter
    ADVANCES IN APPLIED MATHEMATICS, 2013, 50 (01) : 142 - 154
  • [43] Diameter and Treewidth in Minor-Closed Graph Families, Revisited
    Erik D. Demaine
    Mohammad Taghi Hajiaghayi
    Algorithmica , 2004, 40 : 211 - 215
  • [44] On the Existence of Asymptotically Good Linear Codes in Minor-Closed Classes
    Nelson, Peter
    van Zwam, Stefan H. M.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (03) : 1153 - 1158
  • [45] Minimum spanning trees for minor-closed graph classes in parallel
    Gustedt, J
    STACS 98 - 15TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1998, 1373 : 421 - 431
  • [46] Distributed approximation algorithms for weighted problems in minor-closed families
    Czygrinow, A.
    Hanckowiak, M.
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2007, 4598 : 515 - +
  • [47] THE MATROID SECRETARY PROBLEM FOR MINOR-CLOSED CLASSES AND RANDOM MATROIDS
    Huynh, Tony
    Nelson, Peter
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020, 34 (01) : 163 - 176
  • [48] THE DENSEST MATROIDS IN MINOR-CLOSED CLASSES WITH EXPONENTIAL GROWTH RATE
    Geelen, Jim
    Nelson, Peter
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2017, 369 (09) : 6751 - 6776
  • [49] Long induced paths in minor-closed graph classes and beyond
    Hilaire, Claire
    Raymond, Jean-Florent
    ELECTRONIC JOURNAL OF COMBINATORICS, 2023, 30 (01): : 1 - 26
  • [50] A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes
    Tazari, Siamak
    Mueller-Hannemann, Matthias
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2008, 5344 : 360 - +
12345