Complexity analysis for maximum flow problems with arc reversals (Q965819): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-008-9175-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2007899233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time computation of optimal subgraphs of decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quickest flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Preflow Push Algorithms for Maximum Network Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding minimum-cost circulations by canceling negative cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum concave-cost network flow problems: Applications, complexity, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal dynamic routing in communication networks with continuous traffic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4494412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flows in dynamic networks with aggregate arc capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum-throughput dynamic network flows / rank
 
Normal rank

Latest revision as of 19:12, 2 July 2024

scientific article
Language Label Description Also known as
English
Complexity analysis for maximum flow problems with arc reversals
scientific article

    Statements

    Complexity analysis for maximum flow problems with arc reversals (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2010
    0 references
    0 references
    contraflow problem
    0 references
    dynamic contraflow problem
    0 references
    complexity analysis
    0 references
    0 references