An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs

DOI10.1080/00207169908804868zbMath0942.68099OpenAlexW2093063644WikidataQ126245991 ScholiaQ126245991MaRDI QIDQ4944662

Debashis Bera, Madhumangal Pal, Tapan Kumar Pal

Publication date: 23 August 2000

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169908804868

zbMATH Keywords

permutation graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

An efficient PRAM algorithm for maximum-weight independent set on permutation graphs

Cites Work

• Optimal parallel algorithms for finding cut vertices and bridges of interval graphs
• Finding biconnected components in O(n) time for a class of graphs
• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
• An Efficient Parallel Biconnectivity Algorithm
• An optimal parallel algorithm for computing cut vertices and blocks on interval graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs