Abstract
This paper addresses two augmentation problems related to bipartite graphs. The first, a fundamental graph-theoretical problem, is how to add a set of edges with the smallest possible cardinality so that the resulting graph is 2-edge-connected, i.e., bridge-connected, and still bipartite. The second problem, which arises naturally from research on the security of statistical data, is how to add edges so that the resulting graph is simple and dose not contain any bridges. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Huang, P. C., Wei, H. W., Lu, W. C., Shih, W. K., & Hsu, T. S. (2007). Smallest bipartite bridge-connectivity augmentation (extended abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4508 LNCS, pp. 153–166). Springer Verlag. https://doi.org/10.1007/978-3-540-72870-2_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
