Construction of natural cycletrees
1996 (English)In: INFORMATION PROCESSING LETTERS, ISSN 0020-0190, Vol. 60, no 6, 313-318 p.Article in journal (Other scientific) Published
In this article, the following question is answered: Given a cycle C, of size N, how can one compute, in O(N) time, a minimal set of edges E such that adjoining E to the cycle yields a graph with a binary spanning tree having minimal total path length? Th
Place, publisher, year, edition, pages
ELSEVIER SCIENCE BV , 1996. Vol. 60, no 6, 313-318 p.
algorithms; Hamiltonian cycles; binary trees
IdentifiersURN: urn:nbn:se:uu:diva-27210OAI: oai:DiVA.org:uu-27210DiVA: diva2:55104
Addresses: UNIV UPPSALA, DEPT COMP SCI, S-75105 UPPSALA, SWEDEN.2008-10-172008-10-172011-01-15