Computing strictly-second shortest paths (Q287170): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6585464 / rank
 
Normal rank
Property / zbMATH Keywords
 
shortest paths
Property / zbMATH Keywords: shortest paths / rank
 
Normal rank
Property / zbMATH Keywords
 
\(k\)-shortest paths
Property / zbMATH Keywords: \(k\)-shortest paths / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the k Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spanning trees of weighted graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:08, 12 July 2024

scientific article
Language Label Description Also known as
English
Computing strictly-second shortest paths
scientific article

    Statements

    Computing strictly-second shortest paths (English)
    0 references
    0 references
    26 May 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    shortest paths
    0 references
    \(k\)-shortest paths
    0 references