<--- Back to Details
First PageDocument Content
NP-complete problems / Interval graph / Vertex cover / Graph coloring / Matching / Independent set / Dominating set / Path decomposition / Graph theory / Theoretical computer science / Mathematics
Date: 2010-03-19 09:17:44
NP-complete problems
Interval graph
Vertex cover
Graph coloring
Matching
Independent set
Dominating set
Path decomposition
Graph theory
Theoretical computer science
Mathematics

Return of the Boss Problem: Competing Online Against a Non-Adaptive Adversary Magnús M. Halldórsson1 and Hadas Sha hnai2 1

Add to Reading List

Source URL: www.cs.technion.ac.il

Download Document from Source Website

File Size: 241,29 KB

Share Document on Facebook

Similar Documents

Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook

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

Graph theory Po-Shen Loh June

DocID: 1vmTo - View Document

Graph theory Po-Shen Loh June

Graph theory Po-Shen Loh June

DocID: 1vhpu - View Document

Graph theory Po-Shen Loh June

Graph theory Po-Shen Loh June

DocID: 1v8nl - View Document