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

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