Parallel algorithms on interval graphs
From MaRDI portal
Publication:4359285
DOI10.1051/ITA/1995290604511zbMATH Open0881.68088OpenAlexW154483318MaRDI QIDQ4359285FDOQ4359285
Authors: V. B. Balayogan, C. Pandu Rangan 
Publication date: 29 January 1998
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92518
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Depth-first search is inherently sequential
- Title not available (Why is that?)
- Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
- A unified approach to domination problems on interval graphs
- Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
- Probabilistic parallel prefix computation
- Some parallel algorithms on interval graphs
- Optimal parallel algorithms for finding cut vertices and bridges of interval graphs
- Title not available (Why is that?)
Cited In (9)
- Parallel computation on interval graphs: algorithms and experiments
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal parallel algorithms for finding cut vertices and bridges of interval graphs
- Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
- Efficient neighborhood encoding for interval graphs and permutation graphs and \(O(n)\) breadth-first search
- Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph
- Designing efficient parallel algorithms on interval graphs
- Recognizing and representing proper interval graphs in parallel using merging and sorting
This page was built for publication: Parallel algorithms on interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4359285)
