<--- Back to Details
First PageDocument Content
NP-complete problems / Clique / Matching / Vertex cover / Tree / Circuit / Aanderaa–Karp–Rosenberg conjecture / Path decomposition / Graph theory / Theoretical computer science / Mathematics
Date: 2013-04-06 16:29:26
NP-complete problems
Clique
Matching
Vertex cover
Tree
Circuit
Aanderaa–Karp–Rosenberg conjecture
Path decomposition
Graph theory
Theoretical computer science
Mathematics

SIAM J. Comput-98 DISPROVING THE SINGLE LEVEL CONJECTURE ∗

Add to Reading List

Source URL: lovelace.thi.informatik.uni-frankfurt.de

Download Document from Source Website

File Size: 242,60 KB

Share Document on Facebook

Similar Documents

Edsger W. Dijkstra / Network theory / Shortest path problem / Constructible universe / Total least squares

Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook

DocID: 1xVkB - View Document

PDF Document

DocID: 1xkJU - View Document

Graph theory Po-Shen Loh June

DocID: 1vmTo - View Document

Graph theory Po-Shen Loh June

DocID: 1vhpu - View Document

Graph theory Po-Shen Loh June

DocID: 1v8nl - View Document