An efficient parallel graph edge matching algorithm and its applications

DOI10.1007/BF02946522MaRDI QIDQ1288436zbMATH OpenFDO

Authors Jun Ma, Shaohan Ma, Jun Ma

Publication date 13 September 1999

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02946522

zbMATH Keywords

edge matchingundirected graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 1471955
• An improved parallel algorithm for maximal matching
• An optimal parallel algorithm for maximal matching
• o(log⁴ n) time parallel maximal matching algorithm using linear number of processors

Cites work

• A fast and efficient NC algorithm for maximal matching
• A fast and simple randomized parallel algorithm for maximal matching
• An improved parallel algorithm for maximal matching
• An improvement on parallel computation of a maximal matching
• An optimal parallel algorithm for maximal matching
• Arboricity and Subgraph Listing Algorithms
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• Sublinear-Time Parallel Algorithms for Matching and Related Problems
• The Two-Triangle Case of the Acquaintance Graph

Cited in

(6)

• An improved parallel algorithm for maximal matching
• A parallel algorithm for the maximum 2-chain edge packing problem
• Parallel algorithms for flexible pattern matching on big graphs
• Parallelization strategy for elementary morphological operators on graphs: distance-based algorithms and implementation on multicore shared-memory architecture
• Parallel graduated assignment algorithm for multiple graph matching based on a common labelling
• scientific article; zbMATH DE number 1471955 (Why is no real title available?)

This page was built for publication: An efficient parallel graph edge matching algorithm and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1288436)