Computing the Largest Bond and the Maximum Connected Cut of a Graph.
Gabriel L. DuarteHiroshi EtoTesshu HanakaYasuaki KobayashiYusuke KobayashiDaniel LokshtanovLehilton L. C. PedrosaRafael C. S. SchoueryUéverton S. SouzaPublished in: Algorithmica (2021)
Keyphrases
- connected components
- minimum cut
- planar graphs
- random walk
- graph theory
- homology generators
- graph matching
- graph structure
- graph representation
- neural network
- vertex set
- maximum flow
- binary images
- data sets
- graph model
- neighborhood graph
- connected graphs
- graph databases
- spanning tree
- link analysis
- normalized cut
- graph clustering
- random graphs
- np complete
- graph cuts
- similarity measure