An efficient implementation of an algorithm for findingK shortest simple paths (Q4267389): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
label / enlabel / en
 
An efficient implementation of an algorithm for findingK shortest simple paths
Property / author
 
Property / author: Nicos Christofides / rank
Normal rank
 
Property / author
 
Property / author: Nicos Christofides / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for the shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3037095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for the Solution of the <i>N</i> th Best Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Shortest Paths in Sparse Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with an algorithm for finding the k shortest paths in a network / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199909)34:2<88::aid-net2>3.0.co;2-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969097955 / rank
 
Normal rank
Property / title
 
An efficient implementation of an algorithm for findingK shortest simple paths (English)
Property / title: An efficient implementation of an algorithm for findingK shortest simple paths (English) / rank
 
Normal rank

Latest revision as of 10:20, 30 July 2024

scientific article; zbMATH DE number 1347101
Language Label Description Also known as
English
An efficient implementation of an algorithm for findingK shortest simple paths
scientific article; zbMATH DE number 1347101

    Statements

    2 May 2001
    0 references
    \(K\) shortest simple paths
    0 references
    undirected graph
    0 references
    An efficient implementation of an algorithm for findingK shortest simple paths (English)
    0 references

    Identifiers