<--- Back to Details
First PageDocument Content
Routing algorithms / Operations research / NP-complete problems / Matching / Color-coding / Connectivity / Travelling salesman problem / Graph / Dynamic programming / Graph theory / Mathematics / Theoretical computer science
Date: 2006-03-25 14:27:44
Routing algorithms
Operations research
NP-complete problems
Matching
Color-coding
Connectivity
Travelling salesman problem
Graph
Dynamic programming
Graph theory
Mathematics
Theoretical computer science

Add to Reading List

Source URL: people.csail.mit.edu

Download Document from Source Website

File Size: 2,53 MB

Share Document on Facebook

Similar Documents

2016-mst2D color coding-base2

DocID: 1rdOX - View Document

Graph theory / Mathematics / NP-complete problems / Graph coloring / Matching / Bipartite graph / Color-coding / Treewidth / Graph / Cycle / Line graph / Chromatic polynomial

Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office

DocID: 1r8ab - View Document

Graph theory / Graph coloring / Treewidth / Color-coding / Matching / Clique / Graph minor / Tree decomposition

Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs Michael R. Fellows1 , Guillaume Fertin2 , Danny Hermelin?3 , and St´ephane Vialette4 1 School of Electrical Engineering and Computer

DocID: 1qX1s - View Document

Image processing / Vision / Perception / Visual perception / Color space / Grayscale / Filling-in / Efficient coding hypothesis / Color / Image segmentation / RGB color model / Contrast

/home/hansen/doc/papers/coledge/fig/fig013.eps

DocID: 1pJju - View Document

Graph theory / Graph / Matching / Vertex / Tree / Bipartite graph / Network motif / Connectivity / Clique / Color-coding

LNBIReaction Motifs in Metabolic Networks

DocID: 1pkYd - View Document