OpenAlex
PricingAboutJobs
Log inGet started
Work

Near-shortest and K-shortest simple paths

HTML

Year: 2005
Type: article
Source: Networks
DOI: 10.1002/net.20077
Authors: W. Matthew Carlyle, R. Kevin Wood
Institution: Naval Postgraduate School
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: k-shortest paths, simple paths, path enumeration, shortest path, binary search, space complexity, grid networks, road network, polynomial-time algorithms

Open Access status: closed
OpenAlex ID: W2107335359
FWCI: 1.895
Cites: 20
Cited by: 81
Related to: 9
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security