An efficient parallel graph edge matching algorithm and its applications
From MaRDI portal
Publication:1288436
DOI10.1007/BF02946522zbMath0920.68057MaRDI QIDQ1288436
Publication date: 13 September 1999
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Cites Work
- Unnamed Item
- An improvement on parallel computation of a maximal matching
- An improved parallel algorithm for maximal matching
- A fast and simple randomized parallel algorithm for maximal matching
- An optimal parallel algorithm for maximal matching
- A fast and efficient NC algorithm for maximal matching
- Arboricity and Subgraph Listing Algorithms
- Sublinear-Time Parallel Algorithms for Matching and Related Problems
- The Two-Triangle Case of the Acquaintance Graph
This page was built for publication: An efficient parallel graph edge matching algorithm and its applications