Efficient parallel algorithms for permutation graphs

DOI10.1006/jpdc.1995.1052zbMath0826.68057OpenAlexW2027574919MaRDI QIDQ1892868

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

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)

Related Items (3)

An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs ⋮ Weighted independent perfect domination on cocomparability graphs ⋮ Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs

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