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
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
An introduction to parallel algorithms
An introduction to parallel algorithms
An O(n2 log n) algorithm for the Hamiltonian cycle problem on circular-arc graphs
SIAM Journal on Computing
Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs
Information Processing Letters
Efficient parallel recognition algorithms of cographs and distance hereditary graphs
Discrete Applied Mathematics
Parallel computation: models and methods
Parallel computation: models and methods
Weighted connected domination and Steiner trees in distance-hereditary graphs
Discrete Applied Mathematics
Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs
Theoretical Computer Science
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs
Theoretical Computer Science
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs
SIAM Journal on Computing
Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs
SIAM Journal on Discrete Mathematics
An Efficient Parallel Algorithm for the Efficient Domination Problem on Distance-Hereditary Graphs
IEEE Transactions on Parallel and Distributed Systems
Dominating Cliques in Distance-Hereditary Graphs
SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time
WG '01 Proceedings of the 27th 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)
Graphs and Hypergraphs
Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
Theoretical Computer Science
The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper, we solve the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs efficiently in parallel. Let Td(|V|,|E|) and Pd(|V|,|E|) denote the parallel time and processor complexities, respectively, required to construct a decomposition tree of a distance-hereditary graph G = (V, E) on a PRAM model Md. We show that this problem can be solved in O(Td(|V|, |E|) + log|V|) time using O(Pd(|V|,|E|)+(|V|+|E|)/log|V|) processors on Md. Moreover, if G is represented by its decomposition tree form, the problem can be solved optimally in O(log|V|) time using O((|V|+|E|)/log|V|) processors on an EREW PRAM. We also obtain a linear-time algorithm which is faster than the previous known O(|V|3) sequential algorithm.