<--- Back to Details
First PageDocument Content
Graph theory / Mathematics / Discrete mathematics / NP-complete problems / Matching / Graph connectivity / Geometric group theory / Train track map / Minimum-cost flow problem
Date: 2014-06-26 02:33:00
Graph theory
Mathematics
Discrete mathematics
NP-complete problems
Matching
Graph connectivity
Geometric group theory
Train track map
Minimum-cost flow problem

Add to Reading List

Source URL: www-cc.cs.uni-saarland.de

Download Document from Source Website

File Size: 119,77 KB

Share Document on Facebook

Similar Documents

Network flow / Mathematics / Minimum-cost flow problem / Maximum flow problem / Logic form / Operations research / Numerical analysis

. CS711008Z Algorithm Design and Analysis . Lecture 8. Algorithm design technique: Linear programming

DocID: 1qZEi - 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

Graph theory / Mathematics / Bipartite graphs / Parity / Matching / Vertex cover / Incidence coloring / Minimum-cost flow problem

Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014

DocID: 1qOZB - View Document

Graph theory / Mathematics / Discrete mathematics / NP-complete problems / Matching / Graph connectivity / Geometric group theory / Train track map / Minimum-cost flow problem

PDF Document

DocID: 1qFtA - 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