Journal ArticleDOI
Optimal parallel algorithms for finding cut vertices and bridges of interval graphs
Alan P. Sprague,K. H. Kulkarni +1 more
Reads0
Chats0
TLDR
An O(log n ) time algorithm in the EREW PRAM model, using n /log n processors, to find cut vertices, bridges, and blocks (often called biconnected components) of an interval graph having n vertices is presented.About:
This article is published in Information Processing Letters.The article was published on 1992-06-19. It has received 25 citations till now. The article focuses on the topics: Interval graph & Interval (graph theory).read more
Citations
More filters
Journal ArticleDOI
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
TL;DR: A unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected, and total domination problems, on interval graphs on circular-arc graphs is presented.
Journal ArticleDOI
A silent self-stabilizing algorithm for finding cut-nodes and bridges
TL;DR: This paper will prove that the composition of the algorithm with any silent self-stabilizing DFS algorithm is self-Stabilizing, and show that the algorithm needs O(n2) moves to reach a terminal configuration once the DFS spanning tree is computed.
Journal ArticleDOI
A self-stabilizing algorithm for finding articulation points
TL;DR: A self-stabilizing algorithm is presented for finding the articulation points of a connected undirected graph on a distributed or network model of computation after O(n2|E|) moves that is resilient to transient faults and does not require initialization.
Journal ArticleDOI
Efficient algorithms to compute all articulation points of a permutation graph
TL;DR: These are the first known algorithms for the problem on this class of graph which can easily be implemented in parallel which takesO(logn) time andO(n) processors on an EREW PRAM.
Proceedings Article
Parallel Algorithms on Interval Graphs.
TL;DR: This paper presents the first optimal, sublogarithmic algorithms for finding the Depth First Search and Breadth First Search trees of an interval graph.
References
More filters
Computational geometry. an introduction
TL;DR: This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry.
Book
Algorithmic graph theory and perfect graphs
TL;DR: This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems and remains a stepping stone from which the reader may embark on one of many fascinating research trails.
Journal ArticleDOI
Parallel merge sort
TL;DR: A parallel implementation of merge sort on a CREW PRAM that uses n processors and O(logn) time; the constant in the running time is small.