How Fast Can Dense Codes Achieve the Min-Cut Capacity of Line Networks?

Anoosheh Heidarzadeh Amir H. Banihashemi

Published in: CoRR (2012)

Keyphrases

min cut
graph partitioning
max flow min cut
social networks
d objects
graph cuts
energy function
network structure
complex networks
energy minimization
object recognition
pairwise
higher order
long range