Efficient parallel algorithms for bipartite permutation graphs
From MaRDI portal
Publication:5285476
Recommendations
Cites work
Cited in
(25)- Bipartite permutation graphs
- A selected tour of the theory of identification matrices
- Parallel algorithms for separable permutations
- Algorithmic aspects of bipartite graphs
- Efficient parallel algorithms for permutation graphs
- Permuting matrices to avoid forbidden submatrices
- On the recognition of permuted bottleneck Monge matrices
- Perspectives of Monge properties in optimization
- Optimal computation of shortest paths on doubly convex bipartite graphs
- Graph isomorphism and identification matrices: Sequential algorithms
- On opposition graphs, coalition graphs, and bipartite permutation graphs
- Acyclically pushable bipartite permutation digraphs: an algorithm
- OPTIMAL PARALLEL MATCHING ON BIPARTITE PERMUTATION GRAPHS
- scientific article; zbMATH DE number 5307920 (Why is no real title available?)
- Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
- scientific article; zbMATH DE number 1230492 (Why is no real title available?)
- Some Efficient Algorithms for Permutation Graphs
- scientific article; zbMATH DE number 1156661 (Why is no real title available?)
- Application of bipartite graphs for achieving race-free state assignments
- On orthogonal ray graphs
- A permutation parallel algorithm under exchange restriction with message passing interface
- Efficient parallel algorithms for doubly convex-bipartite graphs
- Solving the shortest-paths problem on bipartite permutation graphs efficiently
- Efficient parallel recognition of some circular arc graphs. II
- Bipartite permutation graphs with application to the minimum buffer size problem
This page was built for publication: Efficient parallel algorithms for bipartite permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5285476)
