Coarse grained parallel algorithms for detecting convex bipartite graphs

DOI10.1007/3-540-40064-8_9MaRDI QIDQ2766672zbMATH OpenFDO

Authors E. Cáceres, Frank Dehne, G. Prencipe, Albert M. Chan

Publication date 9 July 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-40064-8_9

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs
• Efficient parallel algorithms for doubly convex-bipartite graphs
• Efficient parallel graph algorithms for coarse grained multicomputers and BSP
• Parallel maximum independent set in convex bipartite graphs
• Algorithms for maximum independent set in convex bipartite graphs

Cited in

(6)

• Algorithms for maximum independent set in convex bipartite graphs
• Parallel maximum independent set in convex bipartite graphs
• Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
• Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs
• Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique
• Efficient parallel algorithms for doubly convex-bipartite graphs

This page was built for publication: Coarse grained parallel algorithms for detecting convex bipartite graphs

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