<--- Back to Details
First PageDocument Content
Combinatorial optimization / NP-complete problems / Graph partition / PageRank / Graph / Cut / Matching / Minimum cut / Graph theory / Line graph
Date: 2008-09-10 16:29:18
Combinatorial optimization
NP-complete problems
Graph partition
PageRank
Graph
Cut
Matching
Minimum cut
Graph theory
Line graph

Microsoft Word - WebArchiving_v6.doc

Add to Reading List

Source URL: wiki.umiacs.umd.edu

Download Document from Source Website

File Size: 207,85 KB

Share Document on Facebook

Similar Documents

“If one university head cut their salary from £250,000 to £140,000, 45 Minimum Wage workers could be paid a Living Wage.”

DocID: 1uEdr - View Document

Graph theory / Network flow / Mathematics / EdmondsKarp algorithm / Flow network / Maximum flow problem / FordFulkerson algorithm / Cut / Graph traversal / Minimum cut / Shortest path problem / Max-flow min-cut theorem

CS261: A Second Course in Algorithms Lecture #2: Augmenting Path Algorithms for Maximum Flow∗ Tim Roughgarden† January 7, 2016

DocID: 1rn0k - View Document

Graph theory / Mathematics / Network flow / Graph connectivity / Combinatorial optimization / Maximum flow problem / Cut / Flow network / Max-flow min-cut theorem / Minimum-cost flow problem

Algorithms and Data Structures Winter TermExercises for Units 25 & 26 1. Suppose you are given a directed graph G = (V, E), two vertices s and t, a capacity function c : E → R+ , and another function f : E →

DocID: 1qUl8 - View Document

Network flow / Graph theory / Mathematics / Maximum flow problem / Flow network / Max-flow min-cut theorem / Minimum-cost flow problem / Matching / Minimum cut / Approximate max-flow min-cut theorem / FordFulkerson algorithm

Single Source Multiroute Flows and Cuts on Uniform Capacity Networks∗ Henning Bruhn† ˇ y‡ Jakub Cern´

DocID: 1qtlI - View Document

Graph theory / Computational complexity theory / Mathematics / Spanning tree / NP-complete problems / Approximation algorithms / Steiner tree problem / Complexity classes / APX / Combinatorial optimization / Minimum spanning tree / Cut

Steiner Tree Approximation via Iterative Randomized Rounding Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvo, Laura Sanita EPFL, Lausanne,

DocID: 1qmUO - View Document