Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/jpdc/BanerjeeGR96
%A Banerjee, S.
%A Ghosh, R. K.
%A Reddy, A. P. K.
%D 1996
%J J. Parallel Distributed Comput.
%K dblp
%N 2
%P 165-171
%T Parallel Algorithm for Shortest Pairs of Edge-Disjoint Paths.
%U http://dblp.uni-trier.de/db/journals/jpdc/jpdc33.html#BanerjeeGR96
%V 33
@article{journals/jpdc/BanerjeeGR96,
added-at = {2020-02-22T00:00:00.000+0100},
author = {Banerjee, S. and Ghosh, R. K. and Reddy, A. P. K.},
biburl = {https://www.bibsonomy.org/bibtex/274165aa264e219d5f777506d2d84def7/dblp},
ee = {https://doi.org/10.1006/jpdc.1996.0035},
interhash = {03255b87694d6ec69669af1bbdbbf286},
intrahash = {74165aa264e219d5f777506d2d84def7},
journal = {J. Parallel Distributed Comput.},
keywords = {dblp},
number = 2,
pages = {165-171},
timestamp = {2020-02-25T12:49:50.000+0100},
title = {Parallel Algorithm for Shortest Pairs of Edge-Disjoint Paths.},
url = {http://dblp.uni-trier.de/db/journals/jpdc/jpdc33.html#BanerjeeGR96},
volume = 33,
year = 1996
}