Algebraic Theory on Shortest Paths for All Flows (Q5743545): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_55 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2396978051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exponent of all pairs shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the unsplittable flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths algorithms: Theory and experimental evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-Route Methods: 1. Reaching, Pruning, and Buckets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the single-source unsplittable flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for two bottleneck optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharing information for the all pairs shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subcubic cost algorithms for the all pairs shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Extensions of the Bottleneck Paths Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer priority queues with decrease key in constant time and the single source shortest paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing Trains Through Railway Stations: Model Formulation and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: All pairs shortest paths using bridging sets and rectangular matrix multiplication / rank
 
Normal rank

Latest revision as of 09:45, 11 July 2024

scientific article; zbMATH DE number 6539354
Language Label Description Also known as
English
Algebraic Theory on Shortest Paths for All Flows
scientific article; zbMATH DE number 6539354

    Statements

    Algebraic Theory on Shortest Paths for All Flows (English)
    0 references
    0 references
    5 February 2016
    0 references
    information sharing
    0 references
    shortest path problem for all flows
    0 references
    priority queue
    0 references
    limited edge cost
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references