Sparsest cuts and concurrent flows in product graphs. Bonsma, P. S. Discrete Applied Mathematics (DAM), 136(2-3):173-182, 2004.
Sparsest cuts and concurrent flows in product graphs [link]Paper  bibtex   
@article{ dblp3632852,
  title = {Sparsest cuts and concurrent flows in product graphs},
  author = {Paul S. Bonsma},
  author_short = {Bonsma, P. S.},
  bibtype = {article},
  type = {article},
  year = {2004},
  key = {dblp3632852},
  id = {dblp3632852},
  biburl = {http://www.dblp.org/rec/bibtex/journals/dam/Bonsma04},
  url = {http://dx.doi.org/10.1016/S0166-218X(03)00439-6},
  journal = {Discrete Applied Mathematics (DAM)},
  pages = {173-182},
  number = {2-3},
  volume = {136},
  text = {Discrete Applied Mathematics (DAM) 136(2-3):173-182 (2004)}
}

Downloads: 0