<--- Back to Details
First PageDocument Content
NP-complete problems / Combinatorial optimization / Graph connectivity / Matching / Steiner tree problem / Minimum spanning tree / Eulerian path / Route inspection problem / Cut / Graph theory / Theoretical computer science / Mathematics
Date: 2008-10-29 00:07:19
NP-complete problems
Combinatorial optimization
Graph connectivity
Matching
Steiner tree problem
Minimum spanning tree
Eulerian path
Route inspection problem
Cut
Graph theory
Theoretical computer science
Mathematics

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 The Embroidery Problem Esther M. Arkin∗ George W. Hart†

Add to Reading List

Source URL: cccg.ca

Download Document from Source Website

File Size: 133,10 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