Finding the k Shortest Paths

Eppstein, David

doi:10.1137/S0097539795290477

Record: found
Abstract: not found
Article: not found

Finding the k Shortest Paths

Author(s): David Eppstein

Publication date Created: January 1998

Publication date (Print): January 1998

Journal: SIAM Journal on Computing

Publisher: Society for Industrial & Applied Mathematics (SIAM)

Read this article at

ScienceOpenPublisher

Bookmark

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Author and article information

Journal

Title: SIAM Journal on Computing

Abbreviated Title: SIAM J. Comput.

Publisher: Society for Industrial & Applied Mathematics (SIAM)

ISSN (Print): 0097-5397

ISSN (Electronic): 1095-7111

Publication date Created: January 1998

Publication date (Print): January 1998

Volume: 28

Issue: 2

Pages: 652-673

Article

DOI: 10.1137/S0097539795290477

SO-VID: d61397da-9de6-460b-848e-d6351ae789fd

History

Data availability:

Comments

Comment on this article

scite_

Cited by 102

See all cited by

Finding the k Shortest Paths

Read this article at

Related collections

Big Data Privacy

Author and article information

Journal

Article

History

Comments

Comment on this article

Similar content 2,538

Cited by 102