A fast and simple randomized parallel algorithm for maximal matching (Q1073573): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Alon Itai / rank
Normal rank
 
Property / author
 
Property / author: Alon Itai / rank
 
Normal rank
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.1016/0020-0190(86)90144-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964932074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved parallel algorithm for maximal matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4164569 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:30, 17 June 2024

scientific article
Language Label Description Also known as
English
A fast and simple randomized parallel algorithm for maximal matching
scientific article

    Statements

    A fast and simple randomized parallel algorithm for maximal matching (English)
    0 references
    0 references
    0 references
    1986
    0 references
    A parallel randomized algorithm to find a maximal matching is presented. Its expected running time on a CRCW-PRAM with \(| E|\) processors in O(log\(| E|)\). The expected time is independent of the structure of the input graph. This improves the best known deterministic algorithm by a factor of \(\log^ 2| E|\).
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel computation
    0 references
    parallel randomized algorithm
    0 references
    CRCW-PRAM
    0 references
    0 references