Article

Free access

Fast algorithms for k-shredders and k-node connectivity augmentation (extended abstract)

Authors:

Joseph Cheriyan,

Ramakrishna ThurimellaAuthors Info & Claims

STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing

Pages 37 - 46

https://doi.org/10.1145/237814.237826

Published: 01 July 1996 Publication History

PDF eReader

References

[1]

D. Bienstock, E. F. Brickell and C. L. Monroe, "On the structure of minimum-weight kconnected spanning networks," SIAM Y. Discrete Math. 3 (1990), 320-329.

Digital Library

Google Scholar

[2]

J. Cheriyan, M. Y. Kao and R. Thurimella, "Scan-first search and sparse certificates: An iraproved parallel algorithm for k-vertex connectivity," SIAM J. Computing 22 (1993), 157-174.

Digital Library

Google Scholar

[3]

T. H. Cormen, C. E. Leiserson and R. L. Rivest, Introduction to Algorithms, The MIT Press, Cambridge, MA, 1990.

Digital Library

Google Scholar

[4]

D. Eppstein, Z. Galil and G. F. italiano, "Iraproved sparsification,' Tech. Report 93-20, Dept. info. & Comput. Sci., University of California, Irvine, CA, 1993.

Google Scholar

[5]

S. Even, Graph Algorithms, Computer Science Press, Potomac, MD, 1979.

Digital Library

Google Scholar

[6]

K.P. Eswaran and R. E. Tarjan, "Augmentation problems," SiAM J. Computing 5 (1976), 653- 665.

Crossref

Google Scholar

[7]

A. Frank, T. Ibaraki and H. Nagamochi, "On sparse subgraphs preserving connectivity properties," J. Graph Theory 17 (1993), 275-281.

Digital Library

Google Scholar

[8]

A. Frank, "Connectivity augmentation problems in network design," in Mathematical Programruing: State of the Art 1994, (Eds. J. R. Birge and K. G. Murty), The University of Michigan, Ann Arbor, MI, 1994, 34--63.

Google Scholar

[9]

Z. Galil, "Finding the vertex connectivity of graphs," SIAM J. Computing 9 (1980), 197-199.

Crossref

Google Scholar

[10]

M. X. Goemans and D. P. Williamson, "The primal-dual method for approximation algorithms and its application to network design problems," In App~ozimation Algorithms for NP-hard Problems, (Ed. D. S. Hochbaum), PWS Publishing Co., Boston, MA, 1995.

Digital Library

Google Scholar

[11]

T. Hsu and V. 1L~ma~an~an, "A linear time algorithm for triconnectivity augmentation," Proc. S~nd iEEE F.O.C.S. (1991), 548-559.

Digital Library

Google Scholar

[12]

T. Hsu, "On four-connecting a triconnected graph," Proc. 3$rd IEEE F.O.C.S. (1992), 70--79.

Google Scholar

[13]

T. Hsu and V. Ramachandran, "Finding a smallest augmentation to biconnect a graph," SIAM .l. Computing 22 (1993), 889-912.

Digital Library

Google Scholar

[14]

T. Hsu, "Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation,' Proc. 6th ISAAC (1995).

Digital Library

Google Scholar

[15]

T. Jordan, "Increasing the vertex-connectivity in directed graphs," Proc. Algorithms -- ESA '93~ 1st Annual European Symposium, LNCS 726, Springer, New York (1993), 236-247.

Digital Library

Google Scholar

[16]

T. Jord~, "On the optimal vertex-connectivity augmentation," J. Combinatorial Theory, Series B 63 (1995), 8-20. Preliminary version in Proc. 3rd LP.~.O. (1993), 75-88.

Digital Library

Google Scholar

[17]

T. J ord~, Ph.D. thesis.

Google Scholar

[18]

T. Jordan, Personal communication, February 1996.

Google Scholar

[19]

D. Karger, "A randomized fully polynomial time approximation scheme for the all terminal network reliability problem," Proc. 27th A CM S.T.O.C. (1995), 11-17.

Digital Library

Google Scholar

[20]

L. Lov~sz, Lecture at Conference in Graph Theory, Prague, 1974.

Google Scholar

[21]

W. Mader, "A reduction method for edgeconnectivity in graphs," Annals of Discrete Math. 3 (1978), 145-164.

Crossref

Google Scholar

[22]

W. Mader, "Konstruktion aUer n-fach kantenzusammenh~ngenden Digraphen,' Europ. J. Combinatorics 3 (1982), 63-67.

Crossref

Google Scholar

[23]

H. Nagamochi and T. Ibaraki, "A linear-time elgorithm for finding a sparse k-connected spanning subgraph of a k-connected graph," Algorithrnica 7 (1992), 583-596.

Crossref

Google Scholar

[24]

J.S. Proven and M. O. Ball, "The complexity of counting cuts and of computing the probability tha~ a graph is connected," SIAM J. Computing 12 (1983), 777-788.

Crossref

Google Scholar

[25]

R. Ravi and D. P. Williamson, "An approximation algorithm for minimum-cost vertexconnectivity problems," Preliminary version in Proc. 6th A ~M-SIAM S.O.D.A. (1995), 332-341. To appear in Algorithmica.

Digital Library

Google Scholar

[26]

T. Watanabe and A. Nakamura, "A smallest augmentation to 3-conncct ~ graph," Discrete Appl. Math. 28 (1990), 183-186.

Digital Library

Google Scholar

Cited By

View all

Egawa YOkadome YTakatou M(2009)5-Shredders in 5-connected graphsDiscrete Mathematics10.1016/j.disc.2008.02.028309:6(1565-1574)Online publication date: 1-Apr-2009
https://dl.acm.org/doi/10.1016/j.disc.2008.02.028
Ando KEgawa Y(2008)Edges not contained in triangles and the distribution of contractible edges in a 4-connected graphDiscrete Mathematics10.1016/j.disc.2007.07.013308:16(3449-3460)Online publication date: 1-Aug-2008
https://dl.acm.org/doi/10.1016/j.disc.2007.07.013
Egawa Y(2008) k ‐shredders in k ‐connected graphs Journal of Graph Theory10.1002/jgt.2033659:3(239-259)Online publication date: 15-Sep-2008
https://doi.org/10.1002/jgt.20336
Show More Cited By

Index Terms

Fast algorithms for k-shredders and k-node connectivity augmentation (extended abstract)
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory

Recommendations

Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation

A k-separator (k-shredder) of a k-node connected undirected graph is a set of k nodes whose removal results in two or more (three or more) connected components. Let n denote the number of nodes. Solving an open question, we show that the problem of ...
On shredders and vertex connectivity augmentation

We consider the following problem: given a k-(node) connected graph G find a smallest set F of new edges so that the graph G+F is (k+1)-connected. The complexity status of this problem is an open question. The problem admits a 2-approximation algorithm. ...
Fast parallel thinning algorithms: parallel speed and connectivity preservation

A recently published parallel thinning approach [4] is evaluated. An improvement is suggested to enable preservation of certain diagonal lines which are not preserved by this algorithm. A unified notion of what is meant by an iteration (or subiteration) ...

Comments

Information & Contributors

Information

Published In

STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing

July 1996

661 pages

ISBN:0897917855

DOI:10.1145/237814

Chairman:
Gary L. Miller

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC96

Sponsor:

SIGACT

STOC96: ACM Symposium on Theory of Computing

May 22 - 24, 1996

Pennsylvania, Philadelphia, USA

Acceptance Rates

STOC '96 Paper Acceptance Rate 74 of 201 submissions, 37%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
462
Total Downloads

Downloads (Last 12 months)87
Downloads (Last 6 weeks)20

Reflects downloads up to 01 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Egawa YOkadome YTakatou M(2009)5-Shredders in 5-connected graphsDiscrete Mathematics10.1016/j.disc.2008.02.028309:6(1565-1574)Online publication date: 1-Apr-2009
https://dl.acm.org/doi/10.1016/j.disc.2008.02.028
Ando KEgawa Y(2008)Edges not contained in triangles and the distribution of contractible edges in a 4-connected graphDiscrete Mathematics10.1016/j.disc.2007.07.013308:16(3449-3460)Online publication date: 1-Aug-2008
https://dl.acm.org/doi/10.1016/j.disc.2007.07.013
Egawa Y(2008) k ‐shredders in k ‐connected graphs Journal of Graph Theory10.1002/jgt.2033659:3(239-259)Online publication date: 15-Sep-2008
https://doi.org/10.1002/jgt.20336
Kleinberg JSandler MSlivkins AMunro I(2004)Network failure detection and graph connectivityProceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms10.5555/982792.982803(76-85)Online publication date: 11-Jan-2004
https://dl.acm.org/doi/10.5555/982792.982803
Tsugaki M(2003)6-Shredders in 6-Connected GraphsSUT Journal of Mathematics10.55937/sut/107882489239:2Online publication date: 1-Jun-2003
https://doi.org/10.55937/sut/1078824892
Ishii TNagamochi HIbaraki T(2003)Augmenting a(k—1)-Vertex-ConnectedMultigraph to an ℓ-Edge-Connected and k-Vertex-Connected MultigraphAlgorithms - ESA’ 9910.1007/3-540-48481-7_36(414-425)Online publication date: 14-Jan-2003
https://doi.org/10.1007/3-540-48481-7_36

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations