Sciweavers

DM
2008

Generating 3-vertex connected spanning subgraphs

13 years 11 months ago
Generating 3-vertex connected spanning subgraphs
In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial time, i.e., for every K we can generate K (or all) minimal 3-vertex connected spanning subgraphs of a given graph in O(K2log(K)m2 + K2m3) time, where n and m are the number of vertices and edges of the input graph, respectively. This is an improvement over what was previously available and is the same as the best known running time for generating 2-vertex connected spanning subgraphs. Our result is obtained by applying the decomposition theory of 2-vertex connected graphs to the graphs obtained from minimal 3-vertex connected graphs by removing a single edge. Key words. 3-vertex connected spanning subgraphs, generation, listing, enumeration
Endre Boros, Konrad Borys, Vladimir Gurvich, G&aac
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2008
Where DM
Authors Endre Boros, Konrad Borys, Vladimir Gurvich, Gábor Rudolf
Comments (0)