JOURNAL ARTICLE

Shortest paths between shortest paths

Marcin KamińskiPaul MedvedevMartin Milanič

Year: 2011 Journal:   Theoretical Computer Science Vol: 412 (39)Pages: 5205-5210   Publisher: Elsevier BV
Keywords:
K shortest path routing Shortest path problem Shortest Path Faster Algorithm Combinatorics Yen's algorithm Euclidean shortest path Mathematics Distance Sequence (biology) Vertex (graph theory) Control reconfiguration Floyd–Warshall algorithm Longest path problem Discrete mathematics Graph Computer science Dijkstra's algorithm Biology

Metrics

75
Cited By
9.91
FWCI (Field Weighted Citation Impact)
13
Refs
0.98
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Interconnection Networks and Systems
Physical Sciences →  Computer Science →  Computer Networks and Communications
Advanced Graph Theory Research
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
graph theory and CDMA systems
Physical Sciences →  Engineering →  Electrical and Electronic Engineering

Related Documents

BOOK-CHAPTER

Shortest Paths between Shortest Paths and Independent Sets

Marcin KamińskiPaul MedvedevMartin Milanič

Lecture notes in computer science Year: 2011 Pages: 56-67
BOOK-CHAPTER

Shortest Paths

Gerard SierksmaDiptesh Ghosh

International series in management science/operations research/International series in operations research & management science Year: 2009 Pages: 17-35
BOOK-CHAPTER

Shortest Paths

K. Erciyes

Undergraduate topics in computer science Year: 2021 Pages: 109-125
BOOK-CHAPTER

Shortest Paths

Shashi ShekharHui Xiong

Encyclopedia of GIS Year: 2008 Pages: 1055-1055
© 2026 ScienceGate Book Chapters — All rights reserved.