The advantages of forward thinking in generating rooted and free trees

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The advantages of forward thinking in generating rooted and free trees

Full text

Pdf (220 KB)

Source

Symposium on Discrete Algorithms archive
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms table of contents

Baltimore, Maryland, United States

Pages: 939 - 940

Year of Publication: 1999

ISBN:0-89871-434-6

Authors

Gang Li	Department of Computer Science, University of Victoria, Victoria. B.C. V8W 3P6, Canada
Frank Ruskey	Department of Computer Science, University of Victoria, Victoria. B.C. V8W 3P6, Canada

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM : Society for Industrial and Applied Mathematics

Publisher

Society for Industrial and Applied Mathematics Philadelphia, PA, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 30, Citation Count: 5

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	T. Beyer and $.M. Hedetniemi. "Constant Time Generation of Rooted Trees". SIAM J. Computing, 9 (1980) 706-712.
	2	Etherington, "Non-associative powers and a (1937) 36.-39.
	3	D.E. Knuth, Fundamental Agorithrns, The Art Wesley.
	4	A. V. K ozina, "Coding and generation of nonisomorphic trees", Cybernetics (Kibernetica), vol. 15 (5), 1975 (1979), pg. 645-651 (38-43).
	5	E. Kubicka, "An Efficient Method of Examining All Trees". Combinatorics. Probabihty and Computing, 5 (1996) 403-413.
	6	E. Kubicka and G. Kubicki, "Constant Time Algorithm for Generating Binary Rooted Trees". Congressus Numerantium, 90 (1992) 57-64.
	7	J. Liu, "Lexicographic generation of rooted trees and trees," Kexue Tongbao, 28 (1983) 448-451.
	8	J. Pallo, "Lexicog-raphic generation of binary unordered trees", Pattern .Recognition Letters, 10 (1989) 217-221.
	9	R. Read, "How to grow trees," in Combinatorial Structures and their Applications, Gordon and Breach, New York, 1970.
	10	H.I. Scions, "Placing Trees in Lexicographic Order". Machine Intelligence, 3 (1969) 43-60.
	11	G. Tinhofer and H. Schrec#, "Linear time tree codes,# Computing, 33 (1984) 211-225.
	12	V. Vajnovszki, "Constant time generation of binary unordered trees,# Bulletin of the European Association for Theoretical Computer Science, 57 (1995) 221-229.
	13	Wedderbura. "The functional equation g(x2) -- 2ax +f(x)', Annals of Mathematics, 24 (1922) 121-140.
	14	H.S. Wilf, Combinatorial Algorithms: An Update, SIAM, CBMS 55, 1989.
	15	Bruce Richmond , Andrew Odlyzko , Brendan D McKay, Constant time generation of free trees, SIAM Journal on Computing, v.15 n.2, p.540-548, May 1986 [doi>10.1137/0215039]

CITED BY 5

	Bart Goethals , Eveline Hoekx , Jan Van den Bussche, Mining tree queries in a graph, Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, August 21-24, 2005, Chicago, Illinois, USA
	James Korsh , Paul Lafollette, A loopless Gray code for rooted trees, ACM Transactions on Algorithms (TALG), v.2 n.2, p.135-152, April 2006
	Joe Sawada, Generating rooted and free plane trees, ACM Transactions on Algorithms (TALG), v.2 n.1, p.1-13, January 2006
	Richard C. Wilson , Ping Zhu, A study of graph spectra for comparing graphs and trees, Pattern Recognition, v.41 n.9, p.2833-2841, September, 2008
	Katsuhisa Yamanaka , Shin-ichiro Kawano , Yosuke Kikuchi , Shin-ichi Nakano, Constant Time Generation of Integer Partitions, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, v.E90-A n.5, p.888-895, May 2007