An improvement on parallel computation of a maximal matching (Q672837): 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.1016/0020-0190(95)00166-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987734035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037417 / 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: A fast and simple randomized parallel algorithm for maximal matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal parallel algorithm for maximal matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing randomness in parallel computation without a processor penalty / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:20, 27 May 2024

scientific article
Language Label Description Also known as
English
An improvement on parallel computation of a maximal matching
scientific article

    Statements

    An improvement on parallel computation of a maximal matching (English)
    0 references
    0 references
    28 February 1997
    0 references
    0 references
    Graph algorithms
    0 references
    Maximal matching
    0 references
    Optimal algorithms
    0 references
    Parallel algorithms
    0 references
    0 references