Work

Finding the k Shortest Paths

Year: 1998

Type: article

Source: SIAM Journal on Computing

DOI: 10.1137/s0097539795290477

Author: David Eppstein

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2131058166

FWCI: 10.99

Cites: 46

Cited by: 1,431

Related to: 10