Parallel algorithms for connectivity problems on interval graphs

DOI10.1016/0020-0190(95)00128-YzbMath0875.68503OpenAlexW2016317523MaRDI QIDQ1350233

Sanjeev Saxena, N. Malahal Rao

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00128-y

zbMATH Keywords

Parallel algorithmsInterval graphBiconnected componentsConnected components

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cites Work

• Some parallel algorithms on interval graphs
• Optimal computation of prefix sums on a binary tree of processors
• Optimal parallel algorithms for finding cut vertices and bridges of interval graphs
• Randomized range-maxima in nearly-constant parallel time
• Parallel concepts in graph theory
• Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex Connectivity
• Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parallel algorithms for connectivity problems on interval graphs