A parallel algorithm for computing Steiner trees in strongly chordal graphs
type: Item
instance of: scholarly article
title: A parallel algorithm for computing Steiner trees in strongly chordal graphs
zbMATH Open document ID: 0810.68081
DOI: 10.1016/0166-218X(94)90093-0
author: Elias Dahlhaus
published in: Discrete Applied Mathematics
publication date: 1994-07-31T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 612429
zbMATH Keywords: efficient parallel algorithm
zbMATH Keywords: minimum Steiner tree
MaRDI profile type: Publication
cites work: Efficient algorithms for computing the reliability of permutation and interval graphs
cites work: Q3948568
cites work: Chordality properties on graphs and minimal conceptual connections in semantic data models
cites work: The parallel solution of domination problems on chordal and strongly chordal graphs
cites work: On rigid circuit graphs
cites work: Characterizations of strongly chordal graphs
cites work: Domination, independent domination, and duality in strongly chordal graphs
cites work: Parallelism in random access machines
cites work: Computing connected components on parallel computers
cites work: Q3997942
cites work: Triangulated graphs and the elimination process
cites work: An O(logn) parallel connectivity algorithm
cites work: An Efficient Parallel Biconnectivity Algorithm
cites work: Implementation of simultaneous memory address access in models that forbid it
cites work: Steiner trees, connected domination and strongly chordal graphs
Recommended article: Parallel local search for Steiner trees in graphs
Recommended article: Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs
Recommended article: Efficient Parallel Algorithms for Chordal Graphs
Recommended article: Q4393289
Recommended article: Fast Parallel Algorithms for Chordal Graphs
Recommended article: Q4247448
Recommended article: Strong Steiner Tree Approximations in Practice
Recommended article: Q3797192
Recommended article: A faster approximation algorithm for the Steiner tree problem in graphs
description: scientific article; zbMATH DE number 612429