On shortest \(T\)-joins and packing \(T\)-cuts (Q1210583): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5675543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching, Euler tours and the Chinese postman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering directed and odd cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices with the Edmonds-Johnson property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight integral duality gap in the Chinese postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Matchings and 2-covers of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3211338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding thet-join structure of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quick proof of Seymour's theorem on t-joins / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Schrijver system of odd join polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected distances and the postman-structure of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3360195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The matroids with the max-flow min-cut property / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Odd Cuts and Plane Multicommodity Flows / rank
 
Normal rank

Latest revision as of 17:08, 17 May 2024

scientific article
Language Label Description Also known as
English
On shortest \(T\)-joins and packing \(T\)-cuts
scientific article

    Statements

    On shortest \(T\)-joins and packing \(T\)-cuts (English)
    0 references
    0 references
    7 February 1995
    0 references
    0 references
    packing
    0 references
    \(T\)-join
    0 references
    \(T\)-cuts
    0 references
    bipartite
    0 references
    series-parallel graphs
    0 references