Efficient parallel algorithms for doubly convex-bipartite graphs

DOI10.1016/0304-3975(94)00220-DzbMath0873.68083OpenAlexW2067593635MaRDI QIDQ672468

Gen-Huey Chen, Chang Wu Yu

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00220-d

zbMATH Keywords

bipartite graphCREW PRAM

Mathematics Subject Classification ID

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

Related Items (8)

On Strict (Outer-)Confluent Graphs ⋮ Path eccentricity of graphs ⋮ On strict (outer-)confluent graphs ⋮ \(L(2,1)\)-labeling of perfect elimination bipartite graphs ⋮ Optimal computation of shortest paths on doubly convex bipartite graphs ⋮ Finding maximum edge bicliques in convex bipartite graphs ⋮ On the complexity of the maximum biplanar subgraph problem ⋮ Biconvex graphs: Ordering and algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On efficient parallel strong orientation
• Bipartite permutation graphs
• An efficient parallel algorithm for planarity
• Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems
• NP-completeness of edge-colouring some restricted graphs
• Parallel recognition of the consecutive ones property with applications
• Parallel Merge Sort
• Efficient parallel algorithms for some graph problems
• An O(logn) parallel connectivity algorithm
• Efficient parallel algorithms for bipartite permutation graphs
• Maximum matching in a convex bipartite graph

This page was built for publication: Efficient parallel algorithms for doubly convex-bipartite graphs