A processor efficient MIS algorithm on random graphs (Q1318767): 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)90094-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069800464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3975003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:22, 22 May 2024

scientific article
Language Label Description Also known as
English
A processor efficient MIS algorithm on random graphs
scientific article

    Statements