Abstract
A c-tree is a tree such that each vertex has a color c ∈ {c 1,c 2,⋯,c m }. In this paper we give a simple algorithm to generate all c-trees with at most n vertices and diameter d, without repetition. Our algorithm generates each c-tree in constant time. By using the algorithm for each diameter 2,3,⋯, n – 1, we can generate all c-trees with n vertices.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Ullman, J.D.: Foundations of Computer Science. Computer Science Press, New York (1995)
Asai, T., Arimura, H., Uno, T., Nakano, S.: Discovering Frequent Substructures in Large Unordered Trees. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds.) DS 2003. LNCS (LNAI), vol. 2843, pp. 47–61. Springer, Heidelberg (2003)
Beyer, T., Hedetniemi, S.M.: Constant Time Generation of Rooted Trees. SIAM J. Comput. 9, 706–712 (1980)
Chi, Y., Nijsseny, S., Muntz, R.R., Kok, J.N.: Frequent Subtree Mining–An Overview. Fundamenta Informaticae, Special Issue on Graph and Tree Mining (2005) (to appear)
Goldberg, L.A.: Efficient Algorithms for Listing Combinatorial Structures. Cambridge University Press, New York (1993)
Kreher, D.L., Stinson, D.R.: Combinatorial Algorithms. CRC Press, Boca Raton (1998)
Li, Z., Nakano, S.: Efficient Generation of Plane Triangulations without Repetitions. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 433–443. Springer, Heidelberg (2001)
Li, G., Ruskey, F.: The Advantage of Forward Thinking in Generating Rooted and Free Trees. In: Proc. 10th Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 939–940 (1999)
McKay, B.D.: Isomorph-free Exhaustive Generation. J. of Algorithms 26, 306–324 (1998)
Nakano, S.: Efficient Generation of Plane Trees. Information Processing Letters 84, 167–172 (2002)
Nakano, S., Uno, T.: Efficient Generation of Rooted Trees, NII Technical Report, NII-2003-005E (2003), http://research.nii.ac.jp/TechReports/03-005E.html
Nakano, S., Uno, T.: Constant Time Generation of Trees with Specified Diameter. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 33–45. Springer, Heidelberg (2004)
Ruskey, F., Sawada, J.: A Fast Algorithm to Generate Unlabeled Necklaces. In: Proc. of SODA 2000, pp. 256–262 (2000)
Read, R.C.: How to Avoid Isomorphism Search When Cataloguing Combinatorial Configurations. Annals of Discrete Mathematics 2, 107–120 (1978)
West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, NJ (2001)
Wilf, H.S.: Combinatorial Algorithms: An Update. SIAM, Philadelphia (1989)
Wright, R.A., Richmond, B., Odlyzko, A., McKay, B.D.: Constant Time Generation of Free Trees. SIAM J. Comput. 15, 540–548 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nakano, Si., Uno, T. (2005). Generating Colored Trees. In: Kratsch, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2005. Lecture Notes in Computer Science, vol 3787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11604686_22
Download citation
DOI: https://doi.org/10.1007/11604686_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31000-6
Online ISBN: 978-3-540-31468-4
eBook Packages: Computer ScienceComputer Science (R0)