4 search results - page 1 / 1 » Generating 3-vertex connected spanning subgraphs |
DM
2008
13 years 11 months ago
2008
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 tim...
COCOON
2007
Springer
14 years 5 months ago
2007
Springer
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.
PKDD
2010
Springer
13 years 9 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
ICDM
2002
IEEE
14 years 4 months ago
2002
IEEE
We investigate new approaches for frequent graph-based pattern mining in graph datasets and propose a novel algorithm called gSpan (graph-based Substructure pattern mining), which...