highlyConnSG {RBGL}R Documentation

Compute highly connected subgraphs for an undirected graph

Description

Compute highly connected subgraphs for an undirected graph

Usage

highlyConnSG(g, sat, ldv)

Arguments

g an instance of the graph class with edgemode “undirected”
sat singleton adoption threshold, positive integer
ldv to remove lower degree vertice, a decreasing sequence of positive integer

Details

A graph G with n vertices is highly connected if its connectivity k(G) > n/2. The HCS algorithm partitions a given graph into a set of highly connected subgraphs, by using minimum-cut algorithm recursively. To improve performance, the approach is refined by adopting singletons, removing low degree vertices and merging clusters.

Value

A list of clusters, each is given as vertices in the graph.

Author(s)

Li Long <li.long@isb-sib.ch>

References

A Clustering Algorithm based on Graph Connectivity by E. Hartuv, R. Shamir, 1999.

See Also

edgeConnectivity, minCut

Examples

coex <- fromGXL(file(system.file("XML/hcs.gxl",package="RBGL")))
highlyConnSG(coex)

[Package RBGL version 1.6.0 Index]