A Study on Distance-Hereditary Graphs

• Main Authors: Wu, Shaur-Ching, 吳韶卿
• Other Authors: Chang Maw-Shang
• Format: Others
• Language: zh-TW
• Published: 1996
• Online Access: http://ndltd.ncl.edu.tw/handle/11987912923285066259

碩士 === 國立中正大學 === 資訊工程學系 === 84 === A distance-hereditary graph G = (V,E) is a connected graph with that every two vertices have the same distance in every connected induced subgraph of G. A Hamiltonian circuit of a graph G is a simple circuit containing all vertices of G. The Hamiltonian circuit problem is to determine whether a graph G has a Hamiltonian circuit or not. Nicolai presented an O( n^3) time algorithm for determining whether or not a distance-hereditary graph has an Hamiltonian circuit provided a d-extremal dismantling scheme is given. In this thesis, we study the properties of one vertex extension (OVE) sequence and develop an O(n^2) time algorithm to improve Nicolai's algorithm.