Fractional covers for forests and matchings (Q3315281): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Khachiyan’s algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of Nonlinear 0-1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cuts and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Applications of Minimum Cuts in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Flows, Minimum Coverings, and the Four-Color Conjectures / rank
 
Normal rank

Latest revision as of 10:57, 14 June 2024

scientific article
Language Label Description Also known as
English
Fractional covers for forests and matchings
scientific article

    Statements

    Fractional covers for forests and matchings (English)
    0 references
    0 references
    0 references
    1984
    0 references
    finite undirected graph
    0 references
    spanning trees
    0 references
    combinatorial optimization
    0 references
    polynomial algorithms
    0 references
    fractional covering problems
    0 references
    forests
    0 references
    b- matchings
    0 references
    ellipsoid algorithm
    0 references

    Identifiers

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