L-RCM: a method to detect connected components in undirected graphs by using the Laplacian matrix and the RCM algorithm
Francisco PedrocheMiguel RebolloCarlos CarrascosaAlberto PalomaresPublished in: CoRR (2012)
Keyphrases
- connected components
- undirected graph
- objective function
- computational complexity
- k means
- graph structure
- binary images
- clustering method
- adjacency matrix
- segmentation algorithm
- laplacian matrix
- tree structure
- segmentation method
- spectral methods
- probabilistic model
- spectral clustering
- level set
- np hard
- special case
- pairwise
- data streams
- eigendecomposition
- data structure
- optimal solution