<--- Back to Details
First PageDocument Content
NP-complete problems / Topological graph theory / Apex graph / Planar separator theorem / Minor / Tree decomposition / Dual graph / Matching / Planarity testing / Graph theory / Planar graphs / Graph operations
Date: 2010-06-29 01:29:34
NP-complete problems
Topological graph theory
Apex graph
Planar separator theorem
Minor
Tree decomposition
Dual graph
Matching
Planarity testing
Graph theory
Planar graphs
Graph operations

Add to Reading List

Source URL: research.nii.ac.jp

Download Document from Source Website

File Size: 200,32 KB

Share Document on Facebook

Similar Documents

The Square Root Phenomenon in Planar Graphs Survey and New Results Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI)

DocID: 1v4B2 - View Document

Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org DETERMINISTICALLY ISOLATING A PERFECT MATCHING IN BIPARTITE PLANAR GRAPHS SAMIR DATTA 1 , RAGHAV KULKARNI 2 , AND SAMBU

DocID: 1uYYo - View Document

Subexponential parameterized algorithms on planar graphs via low-treewidth pattern covering Dániel Marx (joint work with Fedor Fomin, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh)

DocID: 1uVYI - View Document

The Square Root Phenomenon in Planar Graphs Survey and New Results Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI)

DocID: 1uSoc - View Document

Stars and bunches in planar graphs. Part II : General planar graphs and colourings ∗ O. V. Borodin,1 H. J. Broersma,2

DocID: 1uzoK - View Document