Abstract
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.
Cite
CITATION STYLE
Hsieh, S. yuan. (1999). Parallel decomposition of distance-hereditary graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1557, pp. 417–426). Springer Verlag. https://doi.org/10.1007/3-540-49164-3_40
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
