A new?old algorithm for minimum-cut and maximum-flow in closure graphs (Q2744651): 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 / 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.1002/net.1012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2169825170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes—On a Selection Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On implementing the push-relabel method for the maximum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal attack and reinforcement of a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on flows in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Parametric Maximum Flow Algorithm and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Algorithm for the k-cut Problem for Fixed k / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Bipartite Network Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unimodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the minimum cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Deterministic Maximum Flow Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Closure of a Graph and Applications to Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Selection Problem of Shared Fixed Costs and Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Possible Winners in Partially Completed Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple min-cut algorithm / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:10, 3 June 2024

scientific article
Language Label Description Also known as
English
A new?old algorithm for minimum-cut and maximum-flow in closure graphs
scientific article

    Statements

    A new?old algorithm for minimum-cut and maximum-flow in closure graphs (English)
    0 references
    0 references
    0 references
    30 July 2002
    0 references
    closure graph
    0 references
    maximum flow
    0 references
    minimum-cut
    0 references
    sensitivity analysis
    0 references
    Lerchs-Grossmann algorithm
    0 references
    0 references
    0 references

    Identifiers

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