Skip to main content
Conference ProceedingsOPEN ACCESS

Generating minimal k-vertex connected spanning subgraphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4598 LNCS 222-231
DOI: 10.1007/978-3-540-73545-8_23
9Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show that minimal k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Boros, E., Borys, K., Elbassioni, K., Gurvich, V., Makino, K., & Rudolf, G. (2007). Generating minimal k-vertex connected spanning subgraphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4598 LNCS, pp. 222–231). Springer Verlag. https://doi.org/10.1007/978-3-540-73545-8_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free