IMPROVED PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH-FIRST-SEARCH (Q4485123): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q126251894, #quickstatements; #temporary_batch_1719280132499
 
(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.1080/10637199808947393 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2174013806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH FIRST SEARCH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Depth-First Search in $O(\log n)$ Parallel Time / 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 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 / Wikidata QID
 
Property / Wikidata QID: Q126251894 / rank
 
Normal rank

Latest revision as of 04:05, 25 June 2024

scientific article; zbMATH DE number 1455584
Language Label Description Also known as
English
IMPROVED PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH-FIRST-SEARCH
scientific article; zbMATH DE number 1455584

    Statements