Fast Balanced Partitioning of Grid Graphs is Hard. Feldmann, A. E. Technical Report arXiv, 2011.
Fast Balanced Partitioning of Grid Graphs is Hard [link]Paper  bibtex   
@TECHREPORT{DBLP:journals/corr/abs-1111-6745Tr,
  author = {Andreas E. Feldmann},
  title = {{F}ast {B}alanced {P}artitioning of {G}rid {G}raphs is {H}ard},
  institution = {arXiv},
  year = {2011},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  url = {http://arxiv.org/abs/1111.6745},
  volume = {abs/1111.6745}
}

Downloads: 0