MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Edge-Connectivity Augmentation Problems." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

40 documents found, showing 1 through 10. Next 10 →

ATOM

References
by Zoltán Szigeti, J. Bang-jensen, H. Gabow, T. Jordán, Z. Szigeti
…Edge-connectivity augmentations of bipartite graphs Zoltán Szigeti Equipe Combinatoire et…
Add To MetaCart

Augmenting Undirected Edge Connectivity in ~O (n^2) Time
by Andras A Benczur, David R Karger — 2000
… edge splitting and edge connectivity augmentation problems. Our algorithms run in time ~ O(n 2 ) on n…
Add To MetaCart

Two NP-Complete Augmentation Problems
by Tibor Jordan — 1997
… that the Simplicity Preserving Edge-Connectivity Augmentation Problem and the problem of Increasing Edge-Connectivity…
Cited by 5 (4 self) – Add To MetaCart

A 1-(S,T)-Edge-Connectivity Augmentation Algorithm
by Steffen Enni — 1995
… for the 1-(S; T )-edge-connectivity augmentation problem in digraphs. The general k-(S; T )-edge-connectivity…
Add To MetaCart

Augmenting undirected connectivity in RNC and in randomized O(n3) time
by András A. Benczúr — 1994 — In Proceedings of the 26 th ACM Symposium on Theory of Computing [ACM94
… of the maximum flow from s to t is at least c. Given a connectivity increment , the edge augmentation problem…
Cited by 4 (1 self) – Add To MetaCart

Preserving And Increasing Local Edge-Connectivity In Mixed Graphs
by Jørgen Bang-Jensen, András Frank, Bill Jackson — 1995 — SIAM J. Discrete Math
… AND PRELIMINARIES Our main concern, the edge-connectivity augmentation problem, is as follows. What is the minimum…
Cited by 13 (6 self) – Add To MetaCart

Non-tree routing for reliability and yield improvement
by Andrew B. Kahng, Bao Liu, Ion I. Măndoiu — 2002 — in Proceedings of the IEEE/ACM International Conference on Computer-Aided Design
… of the classical 2-edge-connectivity augmentation problem in which we take into account such practical issues…
Cited by 5 (0 self) – Add To MetaCart

Deterministic O(nm) Time Edge-Splitting in Undirected Graphs
by Hiroshi Nagamochi, Toshihide Ibaraki — 1997 — J. Combinatorial Optimization
… algorithms. As applications, we mention in Section 5 the following problems: (P1) augmenting the edge-connectivity…
Cited by 8 (2 self) – Add To MetaCart

A Note on Hypergraph Connectivity Augmentation
by Tamás Király, Technical Reports, Márton Makai — 2002
… problems that are linked to orientations. These problems include (k; l)-edge-connectivity augmentation…
Add To MetaCart

Connectivity Augmentation
by András Frank — 1994
… required to be integer-valued, then the edge-connectivity augmentation problem is equivalent to the max…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB