A polynomial-time partitioning algorithm for weighted cactus graphs.
Maike BuchinLeonie SelbachPublished in: CoRR (2020)
Keyphrases
- partitioning algorithm
- graph partitioning
- weighted graph
- spectral graph
- graph model
- image segmentation
- bounded treewidth
- clustering algorithm
- polynomial time complexity
- data clustering
- spectral clustering
- normalized cut
- multiscale
- pairwise
- shortest path
- edge weights
- image processing
- vertical partitioning
- computer vision