<--- 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

Interactive activity – Lines and bars graph www.webardora.net Activity where we can create a line or a bar graph and also perform several operations on the same data table, etc:

DocID: 1uVcL - View Document

Coordinate Geometry: Straight Lines & Circles Straight lines A. Some basic operations (i) Entering an equation in ‘GRAPH’ mode Example:

DocID: 1sag4 - View Document

Computational complexity theory / Complexity classes / NP-complete problems / Operations research / Combinatorial optimization / Mathematical optimization / Knapsack problem / Reduction / Graph coloring / NP-hardness / NP / Optimization problem

Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger Wattenhofer

DocID: 1rrUb - View Document

Graph theory / Graph operations / Trapezoid graph / Line graph / Intersection graph / Graph

Vertex splitting and the recognition of trapezoid graphs

DocID: 1rrEL - View Document

Mathematics / Mathematical analysis / Numerical analysis / Numerical linear algebra / Mathematical optimization / Operations research / Bundle adjustment / Geodesy / Surveying / Gradient descent / Preconditioner / Cholesky decomposition

g2o: A General Framework for Graph Optimization Rainer K¨ummerle Giorgio Grisetti Hauke Strasdat

DocID: 1rqHa - View Document