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: CoRR (2020)
Keyphrases
- connected components
- minimum cut
- connected graphs
- graph theory
- weighted graph
- graph model
- directed graph
- bipartite graph
- neighborhood graph
- graph representation
- graph theoretic
- random walk
- stable set
- planar graphs
- graph clustering
- graph structure
- structured data
- normalized cut
- spanning tree
- directed acyclic graph
- graph search
- min cut
- maximum flow
- graph matching
- database
- swendsen wang