Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph

DOI10.1080/00207169508804449zbMath0841.68057OpenAlexW2058775253MaRDI QIDQ4870967

G. P. Bhattacharjee, Madhumangal Pal

Publication date: 8 April 1996

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

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

zbMATH Keywords

parallel algorithms

Mathematics Subject Classification ID

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

Related Items

An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs ⋮ \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs ⋮ Computation of diameter, radius and center of permutation graphs ⋮ An optimal algorithm to find minimum k-hop dominating set of interval graphs ⋮ Minimum 2-tuple dominating set of an interval graph ⋮ \(L(2,1)\)-labeling of interval graphs ⋮ An optimal parallel algorithm to construct a tree 3-spanner on interval graphs ⋮ Thek-neighbourhood-covering problem on interval graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A unified approach to domination problems on interval graphs
• Computation of the center and diameter of outerplanar graphs
• A unified approach to parallel depth-first traversals of general trees
• Breadth-first traversal of trees and integer sorting in parallel
• A simple linear-time algorithm for computing the center of an interval graph
• Parallel Merge Sort
• An optimal algorithm to solve the all-pair shortest path problem on interval graphs