An efficient parallel graph edge matching algorithm and its applications (Q1288436): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear-Time Parallel Algorithms for Matching and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and efficient NC algorithm for maximal matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improvement on parallel computation of a maximal matching / 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: The Two-Triangle Case of the Acquaintance Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arboricity and Subgraph Listing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:05, 28 May 2024

scientific article
Language Label Description Also known as
English
An efficient parallel graph edge matching algorithm and its applications
scientific article

    Statements

    Identifiers