Fast data transmission and maximal dynamic flow. (Q2583548): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the constrained quickest path problem and the enumeration of quickest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding the \(k\) quickest paths in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the \(k\) quickest simple paths in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed algorithms for the quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computation of fast data transmissions in networks with capacities and delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: The all-pairs quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the quickest path problem and the enumeration of quickest paths / rank
 
Normal rank

Revision as of 14:20, 11 June 2024

scientific article
Language Label Description Also known as
English
Fast data transmission and maximal dynamic flow.
scientific article

    Statements

    Fast data transmission and maximal dynamic flow. (English)
    0 references
    0 references
    0 references
    0 references
    17 January 2006
    0 references
    Algorithms
    0 references
    Communication networks
    0 references
    Maximal dynamic flows
    0 references
    Minimum transmission time
    0 references
    Quickest paths
    0 references
    Shortest paths
    0 references

    Identifiers