Bitte melden Sie sich an um selbst Rezensionen oder Kommentare zu erstellen.
Zitieren Sie diese Publikation
Mehr Zitationsstile
- bitte auswählen -
%0 Conference Paper
%1 conf/esa/MehlhornP95
%A Mehlhorn, Kurt
%A Priebe, Volker
%B ESA
%D 1995
%E Spirakis, Paul G.
%I Springer
%K
%P 185-198
%T On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka.
%U http://dblp.uni-trier.de/db/conf/esa/esa95.html#MehlhornP95
%V 979
%@ 3-540-60313-1
@inproceedings{conf/esa/MehlhornP95,
added-at = {2023-12-13T01:37:25.000+0100},
author = {Mehlhorn, Kurt and Priebe, Volker},
biburl = {https://www.bibsonomy.org/bibtex/268f3a1af4e49230b2fe39714dd828aea/admin},
booktitle = {ESA},
crossref = {conf/esa/1995},
editor = {Spirakis, Paul G.},
ee = {https://doi.org/10.1007/3-540-60313-1_143},
interhash = {741c037858eba4e375592f6859fab5e2},
intrahash = {68f3a1af4e49230b2fe39714dd828aea},
isbn = {3-540-60313-1},
keywords = {},
pages = {185-198},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2023-12-13T01:37:25.000+0100},
title = {On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka.},
url = {http://dblp.uni-trier.de/db/conf/esa/esa95.html#MehlhornP95},
volume = 979,
year = 1995
}