Generation of all rooted trees up to a given height
Pages 467 - 475
Abstract
Generation of rooted trees is a major area of research in graph theory. The number of rooted trees increases as the order of the graph increases. Many researchers around the world have given different algorithms generating rooted trees with different efficiency. Generation of rooted trees of a given order can be used to solve other combinatorial optimization problems. In this article, we have proposed an algorithm, Rooted-Trees, generating all labelled rooted trees of a given order, n and up to a given height, h (where 1 ≤ h ≤ n − 1). The algorithm, Rooted-Trees, generates the rooted trees of our desire, which are the spanning trees of a given complete graph of order n, assuming one of the vertices of the graph as the root.
References
[1]
Aho AV, Hopcroft JE, Ullman JD (2011) The design and analysis of computer algorithms, ninth impression. Pearson, Noida
[2]
Beyer T and Hedetniemi SM Constant time generation of rooted trees SIAM J Comput 1980 9 706-712
[3]
Brown P and Fenner T Fast generation of unlabelled free trees using weight sequences J Graph Algorithm Appl 2021 25 2 219-240
[4]
Cattell K, Ruskey F, Sawada J, Serra M, and Miers CR Fast algorithms to generate necklaces, unlabelled necklaces and irreducible polynomials over GF (2) J Algorithms 2000 37 2 267-282
[5]
Chakraborty M, Chowdhury S, Chakraborty J, Mehera R, and Pal RK Algorithms for generating all possible spanning trees of a simple undirected connected graph: an extensive review Complex Intell Syst 2019 5 265-281
[6]
Chakraborty M, Mehera R, and Pal RK Divide-and-conquer based all possible spanning tree generation algorithm of a simple connected graph Theor Comput Sci 2022 900 35-52
[7]
Deo N Graph theory with applications to engineering and computer science 2005 New Delhi Prentice Hall of India Pvt Ltd
[8]
Horowitz E, Sahni S (1976) Fundamentals of data structures. Galgotia Booksource, Gurgaon
[9]
Horowitz E, Sahni S, Rajasekaran S (2009) Fundamentals of computer algorithms, 2 edn. University Press, Hydrabad
[10]
Knuth DE The art of computer programming: fundamental algorithms, 1972 Boston Addison-Wesley
[11]
Li G (1996) Generation of rooted trees and free trees. MSc Thesis, Department of Computer Science, University of Victoria, British Columbia. http://webhome.cs.uvic.ca/~ruskey/Theses/GangLiMScThesis.pdf. Accessed 27 Feb 2022
[12]
Li G, Ruskey F (1999) The advantages of forward thinking in generating rooted and free trees. In: 10th annual ACM-SIAM symposium on discrete algorithms (SODA. USA: Society for Industrial and Applied Mathematics, pp 939–940
[13]
Nakano S Efficient generation of plane trees Inf Process Lett 2002 84 167-172
[14]
Nakano S, Uno T (2003) Efficient generation of rooted trees. NII Technical Report
[15]
Parque V, Miyashita T (2021) An efficient scheme for the generation of ordered trees in constant amortized time. In: 15th international conference on ubiquitous information management and communication (IMCOM)
[16]
Ruskey F Generating t-ary trees lexicographically SIAM J Comput 1978 7 4 424-439
[17]
Ruskey F and Hu TC Generating binary trees lexicographically SIAM J Comput 1977 6 4 745-758
[18]
Sawada J Generating rooted and free plane trees ACM Trans Algorithms 2006 2 1 1-13
[19]
Scoins H Placing trees in lexicographic order Mach Intell 1967 3 43-60
[20]
Skarbek W Generating ordered trees Theor Comput Sci 1988 57 153-159
[21]
Zaks S Lexicographic generation of ordered trees Theor Comput Sci 1980 10 63-82
Index Terms
- Generation of all rooted trees up to a given height
Index terms have been assigned to the content through auto-classification.
Recommendations
The Euler Tour Technique and Parallel Rooted Spanning Tree
ICPP '04: Proceedings of the 2004 International Conference on Parallel ProcessingMany parallel algorithms for graph problems start with finding a spanning tree and rooting the tree to define some structural relationship on the vertices which can be used by following problem specific computations. The generic procedure is to find an ...
Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
We present two lower bounds for the maximum number of leaves over all spanning trees of a graph. For connected, triangle-free graphs on $n$ vertices, with minimum degree at least three, we show that a spanning tree with at least $(n+4)/3$ leaves exists. ...
Comments
Information & Contributors
Information
Published In
© The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2022. Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 03 August 2022
Accepted: 03 July 2022
Received: 17 June 2022
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 18 Jan 2025