Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs
DOI10.1080/0020716031000112330zbMATH Open1066.68158OpenAlexW2028478987MaRDI QIDQ4454318FDOQ4454318
Sukumar Mondal, Tapan K. Pal, Madhumangal Pal
Publication date: 8 March 2004
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0020716031000112330
Recommendations
- A parallel algorithm for computing Steiner trees in strongly chordal graphs
- Efficient parallel algorithms for permutation graphs
- Permutation graphs: Connected domination and Steiner trees
- Some Efficient Algorithms for Permutation Graphs
- Improved Computation of Optimal Rectilinear Steiner Minimal Trees
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10)
Cites Work
- Title not available (Why is that?)
- Transitive Orientation of Graphs and Identification of Permutation Graphs
- Title not available (Why is that?)
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
- Title not available (Why is that?)
- Efficient parallel algorithms for permutation graphs
- An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs
- Incremental modular decomposition
- Steiner trees, connected domination and strongly chordal graphs
- An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs
- Topics on domination
- Permutation graphs: Connected domination and Steiner trees
- Connected domination and Steiner set on weighted permutation graphs
Cited In (4)
This page was built for publication: Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4454318)
