Date: 2011-01-10 07:51:45

NP-complete problems

Graph coloring

Graph operations

Path decomposition

Tree decomposition

Connectivity

Graph

List coloring

Independent set

Graph theory

Theoretical computer science

Mathematics

Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal Daniel Lokshtanov∗

Document is deleted from original location.
Use the Download Button below to download from the Web Archive.

File Size: 892,78 KB