Sequential and distributed algorithms for the all pairs quickest path problem

J. B. Rosen; Guo Liang Xue

doi:10.1007/3-540-54029-6_196

Sequential and distributed algorithms for the all pairs quickest path problem

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English (US)
Title of host publication	Advances in Computing and Information – ICCI 1991 - International Conference on Computing and Information, Proceedings
Editors	Waldemar W. Koczkodaj, Frank Dehne, Frantisek Fiala
Publisher	Springer Verlag
Pages	471-473
Number of pages	3
ISBN (Print)	9783540540298
DOIs	https://doi.org/10.1007/3-540-54029-6_196
State	Published - 1991
Externally published	Yes
Event	3rd International Conference on Computing and Information, ICCI 1991 - Ottawa, Canada Duration: May 27 1991 → May 29 1991

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	497 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	3rd International Conference on Computing and Information, ICCI 1991
Country/Territory	Canada
City	Ottawa
Period	5/27/91 → 5/29/91

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-54029-6_196

Cite this

Rosen, J. B., & Xue, G. L. (1991). Sequential and distributed algorithms for the all pairs quickest path problem. In W. W. Koczkodaj, F. Dehne, & F. Fiala (Eds.), Advances in Computing and Information – ICCI 1991 - International Conference on Computing and Information, Proceedings (pp. 471-473). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 497 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-54029-6_196

Sequential and distributed algorithms for the all pairs quickest path problem. / Rosen, J. B.; Xue, Guo Liang.

Advances in Computing and Information – ICCI 1991 - International Conference on Computing and Information, Proceedings. ed. / Waldemar W. Koczkodaj; Frank Dehne; Frantisek Fiala. Springer Verlag, 1991. p. 471-473 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 497 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Rosen, JB & Xue, GL 1991, Sequential and distributed algorithms for the all pairs quickest path problem. in WW Koczkodaj, F Dehne & F Fiala (eds), Advances in Computing and Information – ICCI 1991 - International Conference on Computing and Information, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 497 LNCS, Springer Verlag, pp. 471-473, 3rd International Conference on Computing and Information, ICCI 1991, Ottawa, Canada, 5/27/91. https://doi.org/10.1007/3-540-54029-6_196

Rosen JB, Xue GL. Sequential and distributed algorithms for the all pairs quickest path problem. In Koczkodaj WW, Dehne F, Fiala F, editors, Advances in Computing and Information – ICCI 1991 - International Conference on Computing and Information, Proceedings. Springer Verlag. 1991. p. 471-473. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-54029-6_196

Rosen, J. B. ; Xue, Guo Liang. / Sequential and distributed algorithms for the all pairs quickest path problem. Advances in Computing and Information – ICCI 1991 - International Conference on Computing and Information, Proceedings. editor / Waldemar W. Koczkodaj ; Frank Dehne ; Frantisek Fiala. Springer Verlag, 1991. pp. 471-473 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{f71a4054fc06488d929874520c457b5f,

title = "Sequential and distributed algorithms for the all pairs quickest path problem",

author = "Rosen, {J. B.} and Xue, {Guo Liang}",

note = "Funding Information: This research was supported in part by the Air Force Office of Scientific Research grand AFOSR-; 3rd International Conference on Computing and Information, ICCI 1991 ; Conference date: 27-05-1991 Through 29-05-1991",

year = "1991",

doi = "10.1007/3-540-54029-6_196",

language = "English (US)",

isbn = "9783540540298",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "471--473",

editor = "Koczkodaj, {Waldemar W.} and Frank Dehne and Frantisek Fiala",

booktitle = "Advances in Computing and Information – ICCI 1991 - International Conference on Computing and Information, Proceedings",

}

TY - GEN

T1 - Sequential and distributed algorithms for the all pairs quickest path problem

AU - Rosen, J. B.

AU - Xue, Guo Liang

N1 - Funding Information: This research was supported in part by the Air Force Office of Scientific Research grand AFOSR-

PY - 1991

Y1 - 1991

UR - http://www.scopus.com/inward/record.url?scp=84896344766&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84896344766&partnerID=8YFLogxK

U2 - 10.1007/3-540-54029-6_196

DO - 10.1007/3-540-54029-6_196

M3 - Conference contribution

AN - SCOPUS:84896344766

SN - 9783540540298

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 471

EP - 473

BT - Advances in Computing and Information – ICCI 1991 - International Conference on Computing and Information, Proceedings

A2 - Koczkodaj, Waldemar W.

A2 - Dehne, Frank

A2 - Fiala, Frantisek

PB - Springer Verlag

T2 - 3rd International Conference on Computing and Information, ICCI 1991

Y2 - 27 May 1991 through 29 May 1991

ER -

Sequential and distributed algorithms for the all pairs quickest path problem

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this