BibTeX record journals/ipl/ChenM94

download as .bib file

@article{DBLP:journals/ipl/ChenM94,
  author       = {Peng Chen and
                  Shigeru Masuyama},
  title        = {On the Equivalence in Complexity Among Three Computation Problems
                  on Maximum Number of Edge-Disjoint s-t Paths in a Probabilistic Graph},
  journal      = {Inf. Process. Lett.},
  volume       = {51},
  number       = {4},
  pages        = {195--199},
  year         = {1994},
  url          = {https://doi.org/10.1016/0020-0190(94)00076-X},
  doi          = {10.1016/0020-0190(94)00076-X},
  timestamp    = {Fri, 26 May 2017 22:54:46 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/ChenM94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics