Bipartite perfect matching in pseudo-deterministic NC
From MaRDI portal
Publication:5111418
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Parallel algorithms in computer science (68W10)
Recommendations
Cited in
(10)- A deterministic parallel reduction from weighted matroid intersection search to decision
- On Pseudodeterministic Approximation Algorithms.
- NC algorithms for computing a perfect matching and a maximum flow in one-crossing-minor-free graphs
- Bipartite perfect matching is in quasi-NC
- Quasipolynomial representation of transversal matroids with applications in parameterized complexity
- scientific article; zbMATH DE number 7758310 (Why is no real title available?)
- Planar Maximum Matching: Towards a Parallel Algorithm
- NC algorithms for weighted planar perfect matching and related problems
- Brief announcement: Zero-knowledge protocols for search problems
- On the parallel complexity of constrained read-once refutations in UTVPI constraint systems
This page was built for publication: Bipartite perfect matching in pseudo-deterministic NC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111418)
