Journal of Combinatorial Theory Series B
Distance-hereditary graphs, Steiner trees, and connected domination
SIAM Journal on Computing
A simple parallel tree contraction algorithm
Journal of Algorithms
Discrete Applied Mathematics - Computational combinatiorics
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
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
Parallel Decomposition of Distance-Hereditary Graphs
ParNum '99 Proceedings of the 4th International ACPC Conference Including Special Tracks on Parallel Numerics and Parallel Computing in Image Processing, Video Processing, and Multimedia: Parallel Computation
Note: Computing maximum stable sets for distance-hereditary graphs
Discrete Optimization
| Hi-index | 0.00 |
In the literature, there are quite a few sequential and parallel algorithms to solve problems in a distance-hereditary graph G utilizing techniques discovered from the properties of the problems. Based on structural properties of G, we first sketch characteristics of problems which can be systematic solved on G and then define a general problem-solving paradigm. Given a decomposition tree representation of G, we propose a unified approach to construct sequential dynamic-programming algorithms for several fundamental graph-theoretical problems that fit into our paradigm. We also show that our sequential solutions can be efficiently parallelized using the tree contraction technique.