@inbook{77f1699bb5a24afc9417b4727ad7ff80,

title = "The longest path problem on distance-hereditary graphs",

abstract = "The longest path problem is to find a path of maximum length in a graph. As a generalization of Hamiltonian path problem, it is NP-complete on general graphs. A graph is called distance-hereditary if the distances of each pair of vertices in every connected induced subgraph containing them are the same. In this paper, we present an O(n4) time algorithm to solve the longest path problem on a distance-hereditary graph of n vertices.",

keywords = "Distance-hereditary graphs, Longest path problem, Polynomialtime algorithm",

author = "Guo, {Yi Lu} and Ho, {Chin Wen} and Ko, {Ming Tat}",

year = "2013",

doi = "10.1007/978-3-642-35452-6_9",

language = "???core.languages.en_GB???",

isbn = "9783642354519",

series = "Smart Innovation, Systems and Technologies",

pages = "69--77",

editor = "Jain Lakhmi and Chang Ruay-Shiung and Peng Sheng-Lung",

booktitle = "Advances in Intelligent Systems and Applications -Volume 1 Proceedings of the International Computer Symposium ICS 2012 Held at Hualien,Taiwan",

}