A fast and efficient NC algorithm for maximal matching
From MaRDI portal
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distributed algorithms (68W15)
Recommendations
Cites work
- scientific article; zbMATH DE number 1142306 (Why is no real title available?)
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A fast and simple randomized parallel algorithm for maximal matching
- A fast parallel algorithm for the maximal independent set problem
- An improved parallel algorithm for maximal matching
- An optimal parallel algorithm for maximal matching
- Parallel Symmetry-Breaking in Sparse Graphs
Cited in
(7)- Fast RNC and NC algorithms for maximal path sets
- An efficient parallel graph edge matching algorithm and its applications
- A 2-approximation NC algorithm for connected vertex cover and tree cover
- Fast RNC and NC algorithms for finding a maximal set of paths with an application
- Distributed algorithms for covering, packing and maximum weighted matching
- A fast and simple randomized parallel algorithm for maximal matching
- An efficient NC algorithm for approximate maximum weight matching
This page was built for publication: A fast and efficient NC algorithm for maximal matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1352118)