Efficient parallel algorithms for permutation graphs

DOI10.1006/JPDC.1995.1052MaRDI QIDQ1892868zbMATH OpenOpenAlexFDO

Authors K. Arvind, V. Kamakoti, C. Pandu Rangan

Publication date 6 July 1995

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1995.1052

Mathematics Subject Classification ID

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

Recommendations

• Parallel algorithms for permutation graphs
• Efficient parallel algorithms for bipartite permutation graphs
• scientific article; zbMATH DE number 3972201
• Some Efficient Algorithms for Permutation Graphs
• Efficient parallel algorithms for graph problems
• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
• Parallel algorithms for separable permutations
• scientific article; zbMATH DE number 3905859
• scientific article; zbMATH DE number 4068310

Cited in

(24)

• Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
• Parallel algorithms for permutation graphs
• A heuristic to accelerate in-situ permutation algorithms
• Coloring permutation graphs in parallel
• Parallel algorithms for separable permutations
• Weighted independent perfect domination on cocomparability graphs
• An efficient PRAM algorithm for maximum-weight independent set on permutation graphs
• Coloring permutation graphs in parallel
• An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs
• scientific article; zbMATH DE number 5307920 (Why is no real title available?)
• Efficient neighborhood encoding for interval graphs and permutation graphs and O(n) breadth-first search
• scientific article; zbMATH DE number 3972201 (Why is no real title available?)
• scientific article; zbMATH DE number 4049080 (Why is no real title available?)
• scientific article; zbMATH DE number 1230492 (Why is no real title available?)
• Some Efficient Algorithms for Permutation Graphs
• Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs
• An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs
• scientific article; zbMATH DE number 1436135 (Why is no real title available?)
• Efficient parallel algorithms for bipartite permutation graphs
• A permutation parallel algorithm under exchange restriction with message passing interface
• A compact data structure and parallel algorithms for permutation graphs
• An efficient parallel algorithm for building the separating tree
• An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs
• Solving the shortest-paths problem on bipartite permutation graphs efficiently

This page was built for publication: Efficient parallel algorithms for permutation graphs

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