uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Construction of natural cycletrees
Uppsala University.
Uppsala University.
1996 (English)In: INFORMATION PROCESSING LETTERS, ISSN 0020-0190, Vol. 60, no 6, 313-318 p.Article in journal (Other scientific) Published
Abstract [en]

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.
Keyword [en]
algorithms; Hamiltonian cycles; binary trees
URN: urn:nbn:se:uu:diva-27210OAI: oai:DiVA.org:uu-27210DiVA: diva2:55104
Addresses: UNIV UPPSALA, DEPT COMP SCI, S-75105 UPPSALA, SWEDEN.Available from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-15

Open Access in DiVA

No full text

By organisation
Uppsala University

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 164 hits
ReferencesLink to record
Permanent link

Direct link