Max-flow vitality in undirected unweighted planar graphs.
Giorgio AusielloPaolo Giulio FranciosaIsabella LariAndrea RibichiniPublished in: CoRR (2020)
Keyphrases
- planar graphs
- max flow
- undirected graph
- directed graph
- weighted graph
- energy minimization
- approximation algorithms
- spanning tree
- edge weights
- complex networks
- graph structure
- connected components
- directed acyclic graph
- graph cuts
- minimum cost
- markov random field
- approximate inference
- graph model
- random variables
- graphical models