How fast can dense codes achieve the min-cut capacity of line networks?

Anoosheh Heidarzadeh Amir H. Banihashemi

Published in: ISIT (2012)

Keyphrases

min cut
graph cuts
max flow min cut
social networks
object recognition
particle swarm optimization
graph partitioning