Algorithms for the optimal Hamiltonian path in Halin graphs

MaRDI QIDQ3070289zbMATH OpenFDO

Authors Yueping Li, Dingjun Lou, Yunting Lu

Publication date 2 February 2011

zbMATH Keywords

edge cutsetHalin graphHamiltonian path

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Publication:3484353
• scientific article; zbMATH DE number 3873380
• Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow
• Constrained Steiner trees in Halin graphs
• scientific article; zbMATH DE number 4031743

Cited in

(8)

• Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
• Some Hamilton Paths and a Minimal Change Algorithm
• scientific article; zbMATH DE number 4155883 (Why is no real title available?)
• scientific article; zbMATH DE number 1210362 (Why is no real title available?)
• An approximation algorithm for finding long paths in Hamiltonian graphs
• scientific article; zbMATH DE number 1445365 (Why is no real title available?)
• A successful algorithm for solving directed Hamiltonian path problems
• Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests

This page was built for publication: Algorithms for the optimal Hamiltonian path in Halin graphs

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