<--- Back to Details
First PageDocument Content
NP-complete problems / Graph coloring / Graph operations / Clique / Independent set / Graph / Graph bandwidth / Graph theory / Theoretical computer science / Mathematics
Date: 2006-10-27 09:09:17
NP-complete problems
Graph coloring
Graph operations
Clique
Independent set
Graph
Graph bandwidth
Graph theory
Theoretical computer science
Mathematics

Some hard graph problems in telecoms Keith Briggs

Add to Reading List

Source URL: keithbriggs.info

Download Document from Source Website

File Size: 4,20 MB

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