<--- Back to Details
First PageDocument Content
Graph theory / Mathematics / Computational complexity theory / Edsger W. Dijkstra / Combinatorial optimization / Network theory / Maximal independent set / Graph coloring / Shortest path problem / Matching / Leader election / Minimum spanning tree
Date: 2014-07-11 14:03:09
Graph theory
Mathematics
Computational complexity theory
Edsger W. Dijkstra
Combinatorial optimization
Network theory
Maximal independent set
Graph coloring
Shortest path problem
Matching
Leader election
Minimum spanning tree

Add to Reading List

Source URL: security.cs.georgetown.edu

Download Document from Source Website

File Size: 362,19 KB

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