<--- Back to Details
First PageDocument Content
Tree decomposition / Clique-sum / Path decomposition / Minor / Apex graph / Bidimensionality / Planar separator theorem / Robertson–Seymour theorem / Clique / Graph theory / Planar graphs / Graph operations
Date: 2007-02-21 15:23:14
Tree decomposition
Clique-sum
Path decomposition
Minor
Apex graph
Bidimensionality
Planar separator theorem
Robertson–Seymour theorem
Clique
Graph theory
Planar graphs
Graph operations

Add to Reading List

Source URL: erikdemaine.org

Download Document from Source Website

File Size: 254,07 KB

Share Document on Facebook

Similar Documents

Proof, beliefs, and algorithms through the lens of sum-of-squares 1 An integrality gap for the planted clique problem The Planted Clique problem (sometimes referred to as the hidden clique

DocID: 1sYyH - View Document

Probability distributions / Clique problem / Expected value / Planted clique / Matrix / Markov chain / Normal distribution

JMLR: Workshop and Conference Proceedings vol 40:1–40, 2015 28th Annual Conference on Learning Theory Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems

DocID: 1pbWy - View Document

Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems Yash Deshpande∗ and Andrea Montanari† February 28, 2015 Abstract

DocID: 1mCri - View Document

Robertson–Seymour theorem / Tree decomposition / Minor / Planar graph / Linkless embedding / Graph coloring / Graph structure theorem / Clique-sum / Graph theory / Graph operations / Path decomposition

On Computing Graph Minor Obstruction Sets ∗ Kevin Cattell Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6, Canada

DocID: 18iEc - View Document

Tree decomposition / Robertson–Seymour theorem / Minor / Chordal graph / Tree / Graph / Planar graphs / Degeneracy / Clique-sum / Graph theory / Path decomposition / Graph operations

ELSEVIER Information Processing Letters

DocID: 18cl1 - View Document