A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph.

Alberto Martelli

Published in: J. ACM (1976)

Keyphrases

elimination algorithm
minimum cut
planar graphs
probabilistic inference
maximum flow
maximum likelihood
directed graph
vertex set
graph theory
normalized cut
hadamard transform
gaussian distribution
graph structure
graph partitioning
graph mining
training data
expectation maximization
graphical models
optical flow