Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Computing Excluded Minors Isolde Adler Martin Grohe
 

Summary: Computing Excluded Minors
Isolde Adler Martin Grohe
Institut f¨ur Informatik,
Humboldt Universit¨at zu Berlin
{adler,grohe}@informatik.hu-berlin.de
Stephan Kreutzer
Oxford University
Computing Laboratory
kreutzer@comlab.ox.ac.uk
Abstract
By Robertson and Seymour's graph minor theorem, ev-
ery minor ideal can be characterised by a finite family
of excluded minors. (A minor ideal is a class of graphs
closed under taking minors.) We study algorithms for
computing excluded minor characterisations of minor
ideals. We propose a general method for obtaining such
algorithms, which is based on definability in monadic
second-order logic and the decidability of the monadic
second-order theory of trees. A straightforward applica-
tion of our method yields algorithms that, for a given k,

  

Source: Adler, Isolde - Institut für Informatik, Johann Wolfgang Goethe-Universität Frankfurt am Main
Grohe, Martin - Institut für Informatik, Humboldt-Universität zu Berlin

 

Collections: Computer Technologies and Information Sciences; Mathematics