A parallel algorithm for computing Steiner trees in strongly chordal graphs
From MaRDI portal
Publication:1329803
DOI10.1016/0166-218X(94)90093-0zbMath0810.68081MaRDI QIDQ1329803
Publication date: 31 July 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
Related Items (2)
The parallel solution of domination problems on chordal and strongly chordal graphs ⋮ Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Chordality properties on graphs and minimal conceptual connections in semantic data models
- On rigid circuit graphs
- Domination, independent domination, and duality in strongly chordal graphs
- Characterizations of strongly chordal graphs
- The parallel solution of domination problems on chordal and strongly chordal graphs
- Triangulated graphs and the elimination process
- Efficient algorithms for computing the reliability of permutation and interval graphs
- An Efficient Parallel Biconnectivity Algorithm
- Steiner trees, connected domination and strongly chordal graphs
- Computing connected components on parallel computers
- An O(logn) parallel connectivity algorithm
- Implementation of simultaneous memory address access in models that forbid it
- Parallelism in random access machines
This page was built for publication: A parallel algorithm for computing Steiner trees in strongly chordal graphs
