Contents

Ars Combinatoria

  • Research article

Algorithms for the Optimal Hamiltonian Path in Halin Graphs

Yueping Li1, Dingjun Lou1, Yunting Lu1
1 DEPARTMENT OF COMPUTER SCIENCE SUN YAT-SEN UNIVERSITY GUANGZHOU 510275, P.R. CHINA
  • Published: 30/04/2008

Abstract

This paper deals with the problem of constructing Hamiltonian paths of optimal weights in Halin graphs. There are three versions of the Hamiltonian path: none or one or two of end-vertices are specified. We present \(O(|V|)\) algorithms for all the versions of the problem.

Citation
Yueping Li, Dingjun Lou, Yunting Lu. Algorithms for the Optimal Hamiltonian Path in Halin Graphs[J], Ars Combinatoria, Volume 087. 235-255. .