The obstructions of a minor-closed set of graphs defined by a context-free grammar

被引：0
|
作者：
Courcelle, B [1 ]
Senizergues, G [1 ]
机构：
[1] Univ Bordeaux 1, CNRS, LaBRI, URA 1304, F-33405 Talence, France
来源：
DISCRETE MATHEMATICS | 1998年 / 182卷 / 1-3期
关键词：
D O I：
10.1016/S0012-365X(97)83079-8
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We establish that the finite set of obstructions of a minor-closed set of graphs given by a hyperedge replacement grammar can be effectively constructed. Our proof uses an auxiliary result stating that the system of equations associated with a proper hyperedge replacement grammar has a unique solution.
引用
收藏
页码：29 / 51
页数：23
相关论文
共 50 条
  • [41] Automorphism groups of context-free graphs
    Pelecq, L
    THEORETICAL COMPUTER SCIENCE, 1996, 165 (02) : 275 - 293
  • [42] DESCRIPTIONAL COMPLEXITY OF CONTEXT-FREE GRAMMAR FORMS
    CSUHAJVARJU, E
    KELEMENOVA, A
    THEORETICAL COMPUTER SCIENCE, 1993, 112 (02) : 277 - 289
  • [43] ELIMINATION OF LEFT RECURSION IN CONTEXT-FREE GRAMMAR
    BORDIER, J
    REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1970, 4 (NB3): : 145 - 162
  • [44] ELIMINATION OF LOEFT RECURSIVITY IN A CONTEXT-FREE GRAMMAR
    BORDIER, J
    REVUE FRANCAISE D INFORMATIQUE DE RECHERCHE OPERATIONNELLE, 1970, 4 (NB3): : 145 - &
  • [45] The omphalos context-free grammar learning competition
    Starkie, B
    Coste, F
    van Zaanen, M
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS, 2004, 3264 : 16 - 27
  • [46] Statistical Parsing with Context-Free Filtering Grammar
    Demko, Michael
    Penn, Gerald
    ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2009, 5549 : 52 - +
  • [47] k-apices of minor-closed graph classes. I. Bounding the obstructions
    Sau, Ignasi
    Stamoulis, Giannos
    Thilikos, Dimitrios M.
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2023, 161 : 180 - 227
  • [48] Node-weighted Network Design in Planar and Minor-closed Families of Graphs
    Chekuri, Chandra
    Ene, Alina
    Vakilian, Ali
    ACM TRANSACTIONS ON ALGORITHMS, 2021, 17 (02)
  • [49] Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs
    Chekuri, Chandra
    Ene, Alina
    Vakilian, Ali
    AUTOMATA, LANGUAGES, AND PROGRAMMING, ICALP 2012 PT I, 2012, 7391 : 206 - 217
  • [50] Additive Approximation Algorithms for List-Coloring Minor-Closed Class of Graphs
    Kawarabayashi, Ken-ichi
    Demaine, Erik D.
    Hajiaghayi, MohammadTaghi
    PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 1166 - +
12345