Computing exact minimum cuts without knowing the graph.
Aviad RubinsteinTselil SchrammS. Matthew WeinbergPublished in: CoRR (2017)
Keyphrases
- spanning tree
- graph representation
- weighted graph
- dominating set
- connected dominating set
- graph partitioning
- directed graph
- structured data
- random walk
- homology generators
- graph structure
- graph model
- graph theoretic
- min sum
- min cut
- edge disjoint
- graph databases
- adjacency matrix
- graphical representation
- bayesian networks
- directed acyclic graph
- graph theory
- graph matching
- markov random field
- search algorithm