𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs

✍ Scribed by Ruo-Wei Hung; Maw-Shang Chang

Book ID
108281065
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
413 KB
Volume
341
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A linear-time algorithm for connectedr-d
A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
✍ BrandstοΏ½dt, Andreas; Dragan, Feodor F. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 83 KB πŸ‘ 1 views

A distance-hereditary graph is a connected graph in which every induced path is isometric, i.e., the distance of any two vertices in an induced path equals their distance in the graph. We present a linear time labeling algorithm for the minimum cardinality connected r-dominating set and Steiner tree

Linear-time certifying algorithms for th
Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs
✍ Ruo-Wei Hung; Maw-Shang Chang πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 252 KB

A certifying algorithm for a problem is an algorithm that provides a certificate with each answer that it produces. The certificate is an evidence that can be used to authenticate the correctness of the answer. A Hamiltonian cycle in a graph is a simple cycle in which each vertex of the graph appear