%0 Journal Article %1 journals/ipl/Aggarwal92 %A Aggarwal, Alok %D 1992 %J Inf. Process. Lett. %K dblp %N 3 %P 149-151 %T Parallel Complexity of Computing a Maximal Set of Disjoint Paths. %U http://dblp.uni-trier.de/db/journals/ipl/ipl41.html#Aggarwal92 %V 41

@article{journals/ipl/Aggarwal92, added-at = {2011-07-08T00:00:00.000+0200}, author = {Aggarwal, Alok}, biburl = {https://www.bibsonomy.org/bibtex/21cf911d6a9c8db69da076287c3b20b2b/dblp}, ee = {http://dx.doi.org/10.1016/0020-0190(92)90044-V}, interhash = {ba91b809f6cb38bd06517b8afdfbe0bb}, intrahash = {1cf911d6a9c8db69da076287c3b20b2b}, journal = {Inf. Process. Lett.}, keywords = {dblp}, number = 3, pages = {149-151}, timestamp = {2011-07-09T11:33:09.000+0200}, title = {Parallel Complexity of Computing a Maximal Set of Disjoint Paths.}, url = {http://dblp.uni-trier.de/db/journals/ipl/ipl41.html#Aggarwal92}, volume = 41, year = 1992 }