One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs (Q1273088): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A survey of dynamic network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quickest flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Maximal Dynamic Flows from Static Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost dynamic flows: The series-parallel case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the throughput of a network with dedicated lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Convex Cost Dynamic Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687194 / rank
 
Normal rank

Revision as of 16:36, 28 May 2024

scientific article
Language Label Description Also known as
English
One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs
scientific article

    Statements

    One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs (English)
    0 references
    0 references
    0 references
    6 December 1998
    0 references
    dynamic network
    0 references
    directed graph
    0 references
    dedicated arcs
    0 references
    NP-hard
    0 references
    maximum flow
    0 references

    Identifiers