Multiflow Feasibility: An Annotated Tableau (Q2971612): 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.1007/978-3-540-76796-1_12 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W30616553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3351113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimax Theorem for Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Three-Linking in Eulerian Dgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Klein bottle and multicommodity flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing paths in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial approaches to multiflow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility of Two Commodity Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding <i>k</i> Disjoint Paths in a Directed Planar Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flows in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Odd Cuts and Plane Multicommodity Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer plane multiflows with a mixed number of demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of some edge-disjoint paths problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the planar directed edge-disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulerian disjoint paths problem in grid graphs is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal multicut and maximal integer multiflow: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3360021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, flows, and VLSI-layout. Proceedings of a meeting held from June 20 to July 1, 1988, at the University of Bonn, Germany / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of routing two pairs on one face / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:20, 13 July 2024

scientific article
Language Label Description Also known as
English
Multiflow Feasibility: An Annotated Tableau
scientific article

    Statements

    Multiflow Feasibility: An Annotated Tableau (English)
    0 references
    0 references
    0 references
    7 April 2017
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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