An optimal parallel algorithm for maximal matching (Q1341686): 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(94)90130-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998998849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic coin tossing with applications to optimal parallel list ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing a Maximal Independent Set in Parallel / 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: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:13, 23 May 2024

scientific article
Language Label Description Also known as
English
An optimal parallel algorithm for maximal matching
scientific article

    Statements