Covering symmetric supermodular functions with graph edges: A short proof of a theorem of Benczúr and Frank.
Attila BernáthPublished in: Inf. Process. Lett. (2017)
Keyphrases
- directed graph
- weighted graph
- spanning tree
- directed acyclic graph
- interactive theorem proving
- undirected graph
- edge weights
- graph theory
- vertex set
- directed edges
- connected components
- spectral embedding
- strongly connected components
- random walk
- real world graphs
- graph clustering
- graph model
- graph representation
- image processing
- theorem proving
- structured data
- graph data
- graph mining
- graph structure
- shortest path
- image segmentation