The Hamiltonian problem on distance-hereditary graphs

DOI10.1016/J.DAM.2005.07.012zbMATH Open1095.68084OpenAlexW2157955289MaRDI QIDQ2489947FDOQ2489947

Authors: Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko 

Publication date: 28 April 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.07.012

Recommendations

• scientific article; zbMATH DE number 2089962
• An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs
• Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
• Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs
• Finding a minimum path cover of a distance-hereditary graph in polynomial time

zbMATH Keywords

PRAMParallel algorithmsHamiltonian problemDistance-hereditary graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Distance in graphs (05C12) Parallel algorithms in computer science (68W10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Distance-hereditary graphs
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient parallel recognition algorithms of cographs and distance hereditary graphs
• Dominating cliques in distance-hereditary graphs
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• Completely separable graphs
• A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
• Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs
• Efficient parallel recognition of cographs
• A simple parallel tree contraction algorithm
• Tree-based parallel algorithm design
• Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs
• Parallel algorithms for Hamiltonian problems on quasi-threshold graphs
• The path-partition problem in bipartite distance-hereditary graphs
• Weighted connected domination and Steiner trees in distance-hereditary graphs
• A time-optimal solution for the path cover problem on cographs.
• Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs
• A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs

Cited In (18)

• Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs
• Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
• Fast and simple algorithms for counting dominating sets in distance-hereditary graphs
• An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
• Hamilton cycles in almost distance-hereditary graphs
• Uniquely Hamiltonian characterizations of distance-hereditary and parity graphs
• Finding a minimum path cover of a distance-hereditary graph in polynomial time
• Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs
• A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
• Distance problems within Helly graphs and \(k\)-Helly graphs
• Title not available (Why is that?)
• Parallel algorithms for Hamiltonian problems on quasi-threshold graphs
• A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs
• An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs
• Laminar structure of ptolemaic graphs with applications
• Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs
• Cyclability in graph classes

This page was built for publication: The Hamiltonian problem on distance-hereditary graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489947)