Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems (Q1183464): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4197644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Minimum-Cost Circulations by Successive Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Las Vegas RNC algorithm for maximum matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing a perfect matching is in random NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / 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: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching is as easy as matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3330973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding thet-join structure of 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: Q3707420 / rank
 
Normal rank

Revision as of 15:48, 15 May 2024

scientific article
Language Label Description Also known as
English
Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems
scientific article

    Statements

    Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems (English)
    0 references
    28 June 1992
    0 references
    parallel complexity of matching
    0 references
    perfect matching
    0 references
    Las Vegas RNC algorithm
    0 references
    \(T\)-join problem
    0 references
    0 references

    Identifiers

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