Processor efficient parallel matching (Q2471700): 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/s00224-007-9018-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021453140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster scaling algorithms for general graph matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved processor bounds for combinatorial problems in RNC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly Optimal Algorithms for Canonical Matrix Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Parallel Algorithms in Numerical Linear Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classroom Note:A Simple Proof of the Leverrier--Faddeev Characteristic Polynomial Algorithm / 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: Q3891767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow in Planar Graphs with Multiple Sources and Sinks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / 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: Maximum matchings in general graphs through randomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-order lifting and integrality certification / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851616 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:11, 27 June 2024

scientific article
Language Label Description Also known as
English
Processor efficient parallel matching
scientific article

    Statements

    Processor efficient parallel matching (English)
    0 references
    0 references
    18 February 2008
    0 references
    Parallel algorithms
    0 references
    Maximum matching
    0 references
    Fast matrix multiplication
    0 references
    RNC algorithm
    0 references

    Identifiers