Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

OriginalsprogEngelsk
TitelFoundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on
Antal sider10
ForlagIEEE Computer Society Press
Publikationsdato2011
Sider37-46
ISBN (Trykt)978-1-4577-1843-4
DOI
StatusUdgivet - 2011
Eksternt udgivetJa
Begivenhed2011 IEEE 52nd Annual Symposium on Foundations of Computer Science - Palm Springs, California, USA
Varighed: 22 okt. 2011 → 25 okt. 2011
Konferencens nummer: 52

Konference

Konference2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Nummer52
LandUSA
ByPalm Springs, California
Periode22/10/2011 → 25/10/2011

    Forskningsområder

  • computational complexity, graph theory, polynomials, Ku-minor, approximation algorithm, polynomial time dependency, separator theorems, shallow minor free graphs, time algorithm, Algorithm design and analysis, Approximation algorithms, Approximation methods, Clustering algorithms, Heuristic algorithms, Particle separators, Partitioning algorithms, maximum matching, minor-free graph, separator, shallow minor-free graph, shortest path

ID: 46433829