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/algorithmica/EaswarakumarKRS96
%A Easwarakumar, K. S.
%A Krishnan, S. V.
%A Rangan, C. Pandu
%A Seshadri, S.
%D 1996
%J Algorithmica
%K dblp
%N 3
%P 242-255
%T Optimal Parallel Algorithm for Finding st-Ambitus of a Planar Biconnected Graph.
%U http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica15.html#EaswarakumarKRS96
%V 15
@article{journals/algorithmica/EaswarakumarKRS96,
added-at = {2022-10-02T00:00:00.000+0200},
author = {Easwarakumar, K. S. and Krishnan, S. V. and Rangan, C. Pandu and Seshadri, S.},
biburl = {https://www.bibsonomy.org/bibtex/27f6a4a8e646fec9076bff7a9ee67a396/dblp},
ee = {https://doi.org/10.1007/BF01975868},
interhash = {1a13286ff770cb72ff6adc3e9c78b82d},
intrahash = {7f6a4a8e646fec9076bff7a9ee67a396},
journal = {Algorithmica},
keywords = {dblp},
number = 3,
pages = {242-255},
timestamp = {2024-04-08T18:21:00.000+0200},
title = {Optimal Parallel Algorithm for Finding st-Ambitus of a Planar Biconnected Graph.},
url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica15.html#EaswarakumarKRS96},
volume = 15,
year = 1996
}
