Efficient parallel algorithms on distance hereditary graphs

Parallel Processing Letters

Volumn 9, Issue 1, 1999, Pages 43-52

  Sun Yuan, Hsieh ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; RANDOM ACCESS STORAGE; SET THEORY; TREES (MATHEMATICS);

CLIQUE; CONNECTED DOMINATING SET; DISTANCE HEREDITARY GRAPH; STEINER TREE;

PARALLEL ALGORITHMS;

EID: 0032662940     PISSN: 02196264     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (2)

1. K. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka, "A simple parallel tree contraction algorithm," Journal of Algorithms, vol. 10, no. 2, pp. 287-302, 1989.
2. H. J. Bandelt and H. M. Mulder, "Distance-hereditary graphs," Journal of Combinatorial Theory Series B, vol. 14, no. 1, pp. 182-208, 1986.