R. Diestel. Graph Theory. Number 173 in Graduate Texts in Mathematics. Springer, 2000. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A 2-approximation for Minimum Cost {0, 1, 2} Vertex Connectivity - Fleischer (2001) (Correct)
....times. In our case, this would be at most twice. In fact, the problem appears to be only harder when we are restricted to selecting an edge at most once. We give the linear programming formulation below. The constraints are based on a theorem of Menger. For multiple proofs and references, see [4]) Theorem I (Menger) Let G = V,E) be a graph, and s,t V such that (s, t) E. Then, the minimum number of vertices separating s from t in G is equal to the maximum number of vertex disjoint paths from s to t in G. For any subset C V, and disjoint set of vertices A C V , we express the ....
R. Diestel. Graph Theory. Number 173 in Graduate Texts in Mathematics. Springer-Verlag, New York, 2nd edition, 2000.
An Iterative Rounding 2-Approximation Algorithm for the Element.. - Fleischer (2001) (4 citations) (Correct)
....graph obtained from by removing all edges and vertices in , and all edges in . We say that separates are not in the same connected component of X . The constraints of our integer program are based on a theorem of Menger (for multiple proofs and references, see [5]) Theorem 3.1 (Menger) Let h be a graph, and d of vertices separating from in is equal to the maximum number of vertex disjoint paths from to in . Corollary 3.2 Let be a graph, with of elements in separating is equal to the ....
R. Diestel. Graph Theory. Number 173 in Graduate Texts in Mathematics. Springer-Verlag, New York, 2nd edition, 2000.
Treewidth in Verification: Local vs. Global - Ferrara, Pan, Vardi (Correct)
No context found.
R. Diestel. Graph Theory. Number 173 in Graduate Texts in Mathematics. Springer, 2000.
RDF Query Languages Need Support for Graph Properties - Angles, Gutierrez, Hayes (Correct)
No context found.
Reinhard Diestel. Graph Theory. Number 173 in Graduate Texts in Mathematics. Springer-Verlag New York, Inc, 1997.
The Design and Analysis of Bulk-Synchronous Parallel Algorithms - Tiskin (1998) (7 citations) (Correct)
No context found.
R. Diestel. Graph Theory. Number 173 in Graduate Texts in Mathematics. Springer, 1997.
Iterative Rounding 2-Approximation Algorithms for.. - Fleischer, Jain.. (2002) (Correct)
No context found.
R. Diestel. Graph Theory. Number 173 in Graduate Texts in Mathematics. Springer-Verlag, New York, 2nd edition, 2000.
The Design and Analysis of Bulk-Synchronous Parallel Algorithms - Tiskin (1998) (7 citations) (Correct)
No context found.
R. Diestel. Graph Theory. Number 173 in Graduate Texts in Mathematics. Springer, 1997.
Packing Tripods: Narrowing the Density Gap - Tiskin (2004) (Correct)
No context found.
R. Diestel. Graph Theory. Number 173 in Graduate Texts in Mathematics. Springer, second edition, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC