On computing graph minor obstruction sets

Kevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston. On computing graph minor obstruction sets. Theoretical Computer Science, 233(1-2):107-127, 2000. [doi]

@article{CattellDDFL00,
  title = {On computing graph minor obstruction sets},
  author = {Kevin Cattell and Michael J. Dinneen and Rodney G. Downey and Michael R. Fellows and Michael A. Langston},
  year = {2000},
  doi = {10.1016/S0304-3975(97)00300-9},
  url = {http://dx.doi.org/10.1016/S0304-3975(97)00300-9},
  tags = { obstruction sets, forbidden minors, graph minors, graph-rewriting, rewriting, search},
  researchr = {https://researchr.org/publication/CattellDDFL00},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {233},
  number = {1-2},
  pages = {107-127},
}