A parallel algorithm for the maximum 2-chain edge packing problem
From MaRDI portal
Publication:1123636
DOI10.1016/0020-0190(89)90018-5zbMath0677.68078OpenAlexW2010684298MaRDI QIDQ1123636
Publication date: 1989
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2324/3115
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Theory of operating systems (68N25)
Cites Work
- Finding Euler tours in parallel
- Chain packing in graphs
- Depth-first search is inherently sequential
- An improved parallel algorithm for maximal matching
- Constructing a perfect matching is in random NC
- A random NC algorithm for depth first search
- On the Complexity of General Graph Factor Problems
- An O(logn) parallel connectivity algorithm
- Implementation of simultaneous memory address access in models that forbid it
This page was built for publication: A parallel algorithm for the maximum 2-chain edge packing problem
