<--- Back to Details
First PageDocument Content
NP-complete problems / Analysis of algorithms / Parameterized complexity / Planar graphs / Graph operations / Bidimensionality / Apex graph / Tree decomposition / Dominating set / Graph theory / Theoretical computer science / Mathematics
Date: 2004-10-18 03:25:13
NP-complete problems
Analysis of algorithms
Parameterized complexity
Planar graphs
Graph operations
Bidimensionality
Apex graph
Tree decomposition
Dominating set
Graph theory
Theoretical computer science
Mathematics

Add to Reading List

Source URL: erikdemaine.org

Download Document from Source Website

File Size: 256,55 KB

Share Document on Facebook

Similar Documents

Ng Kong Beng Public Lecture Series 黄光明公开讲座 For the past 40 years computer scientists generally believed that NP-complete problems are intractable. In particular, Boolean satisfiability (SAT), as a paradigma

DocID: 1udfk - View Document

Djinni 2.1 Approximating NP-Complete Problems, Fast Jeff Ohlmann, Barrett Thomas, Robert Hansen, Tristan Thiede Presented at OSCON 2006

DocID: 1tIrp - View Document

Graph theory / Mathematics / Search algorithms / Graph traversal / Breadth-first search / Vertex / NP-complete problems / Graph coloring / Planar graphs / Depth-first search

Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved

DocID: 1rtvU - View Document

Theoretical computer science / Mathematics / Computational complexity theory / Operations research / Logic in computer science / Mathematical optimization / NP-complete problems / Boolean algebra / Maximum satisfiability problem / Boolean satisfiability problem / Constraint satisfaction / Solver

On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon

DocID: 1rsZm - View Document

Graph theory / Bipartite graphs / Planar graphs / Induced path / NP-complete problems / Parity graph

Induced paths of given parity in planar graphs Naomi Nishimura University of Waterloo Canada

DocID: 1rsEH - View Document