Finding maximum weight arborescence in an edge-weighted DAG. Ito, T. \emphTheoretical Computer Science – Stack Exchange. Url: http://cstheory.stackexchange.com/q/4088/189, Retrieved: Oct 12, 2011
Finding maximum weight arborescence in an edge-weighted DAG [link]Paper  bibtex   
@Misc{ito11finding,
  author       = {Tsuyoshi Ito},
  title        = {Finding maximum weight arborescence in an edge-weighted {DAG}},
  howpublished = {\emph{Theoretical Computer Science -- Stack Exchange}},
  note         = {Url: http://cstheory.stackexchange.com/q/4088/189, Retrieved: Oct 12, 2011},
  owner        = {imran},
  timestamp    = {2011.01.21},
  url          = {http://cstheory.stackexchange.com/q/4088/189},
}
Downloads: 0