Journal of Combinatorial Theory Series B
Distance-hereditary graphs, Steiner trees, and connected domination
SIAM Journal on Computing
SIAM Journal on Computing
A simple parallel tree contraction algorithm
Journal of Algorithms
Discrete Applied Mathematics - Computational combinatiorics
An introduction to parallel algorithms
An introduction to parallel algorithms
Efficient parallel recognition algorithms of cographs and distance hereditary graphs
Discrete Applied Mathematics
Efficient Parallel Algorithms on Distance-Hereditary Graphs
ICPP '97 Proceedings of the international Conference on Parallel Processing
Dominating Cliques in Distance-Hereditary Graphs
SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
A New Simple Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs
IRREGULAR '98 Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel
Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes
WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
Dynamic Programming on Distance-Hereditary Graphs
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
| Hi-index | 0.00 |
A distance-Hereditary graph G has a binary tree representation called a decomposition tree. Given a decomposition tree, many graph-theoretical problems can be efficiently solved on G using the binary tree contraction technique. In this paper, we present an algorithm to construct a decomposition tree in O(log2 n) time using O(n+m) processors on a CREW PRAM, where n and m are the number of vertices and edges of G, respectively.