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
 

Summary: COMPUTING EXCLUDED MINORS
Isolde Adler
Humboldt University Berlin
Joint work with
Martin Grohe and Stephan Kreutzer
Structure Theory and FPT Algorithms
Dagstuhl, July 9, 2007
Outline
1. Introduction
2. Excluded minors for unions
3. A general method for computing minors
4. Open Problems
ISOLDE ADLER COMPUTING EXCLUDED MINORS 2/18
Graphs and Minors
· Graphs are undirected, simple, finite
· Graph G: vertex set V(G), edge set E(G)
· A graph H is a minor of G, H G, if
H is obtained from a subgraph of G by contracting edges
ISOLDE ADLER COMPUTING EXCLUDED MINORS 3/18
Graphs and Minors

  

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

 

Collections: Computer Technologies and Information Sciences