<--- Back to Details
First PageDocument Content
Planar graphs / Graph coloring / Clique-sum / Apex graph / Minor / Path decomposition / Bidimensionality / Robertson–Seymour theorem / Tree decomposition / Graph theory / Theoretical computer science / Graph operations
Date: 2009-04-27 18:13:24
Planar graphs
Graph coloring
Clique-sum
Apex graph
Minor
Path decomposition
Bidimensionality
Robertson–Seymour theorem
Tree decomposition
Graph theory
Theoretical computer science
Graph operations

Add to Reading List

Source URL: erikdemaine.org

Download Document from Source Website

File Size: 216,46 KB

Share Document on Facebook

Similar Documents

Graph theory / NP-complete problems / Planar graph / Dominating set / Vertex / Degree / Cycle / Line graph / Bidimensionality

The Price of Connectivity for Feedback Vertex Set R´emy Belmonte1,∗ , Pim van ’t Hof1,∗ , Marcin Kami´ nski2 , and 3,† Dani¨el Paulusma 1

DocID: 1pwfu - View Document

NP-complete problems / Analysis of algorithms / Complexity classes / Parameterized complexity / Kernelization / Bidimensionality / Dominating set / Exponential time hypothesis / Feedback vertex set / Theoretical computer science / Computational complexity theory / Applied mathematics

The Computer Journal Special Issue on Parameterized Complexity: Foreward by the Guest Editors Rodney G. Downey Victoria University Wellington, New Zealand

DocID: 18SN0 - View Document

NP-complete problems / Analysis of algorithms / Parameterized complexity / Graph coloring / Bidimensionality / Kernelization / Dominating set / Branch-decomposition / Vertex cover / Theoretical computer science / Graph theory / Computational complexity theory

Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 2, NovemberWelcome

DocID: 18nCT - View Document

NP-complete problems / Analysis of algorithms / Parameterized complexity / Kernelization / Bidimensionality / Dominating set / Tree decomposition / Path decomposition / Feedback vertex set / Theoretical computer science / Computational complexity theory / Graph theory

The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number ? Michael Fellows1,2 and Frances Rosamond1

DocID: 18hsx - View Document

NP-complete problems / Bidimensionality / Parameterized complexity / Kernelization / Branch-decomposition / Path decomposition / Tree decomposition / Clique / Feedback vertex set / Graph theory / Theoretical computer science / Mathematics

Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 3, MayWelcome

DocID: 17EZx - View Document