Coding and generation of nonisomorphic trees-Reference-Cited by-同舟云学术

Coding and generation of nonisomorphic trees

Published:1980 Issue:5 Volume:15 Page:645-651
ISSN:0011-4235
Container-title:Cybernetics
language:en
Short-container-title:Cybern Syst Anal

Author:

Kozina A. V.

Publisher

Springer Science and Business Media LLC

Subject

General Computer Science,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01071214.pdf

Reference7 articles.

1. F. Harary, Graph Theory, Addison-Wesley (1969).

2. R. Bassacker and T. Saati, Finite Graphs and Networks [Russian translation], Nauka, Moscow (1974).

3. V. N. Zemlyachenko, ?On the isomorphism of trees,? Proc. Seminar on Combinatorial Mathematics, in: Questions of Cybernetics [in Russian], Moscow (1973).

4. J. E. Hopcroft and R. E. Tarjian, ?Isomorphism of planar graphs,? in: Cybernetic Collection [Russian translation], New Series, No. 12, Mir (1975).

5. M. Gordon and J. W. Kennedy, ?The counting and coding of trees of fixed diameter,? SIAM J. Appl. Math., 28, No. 2 (1975).

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Enumerating Treelike Chemical Graphs with Given Path Frequency;Journal of Chemical Information and Modeling;2008-06-28

2. Generation of Valid Labeled Binary Trees;Computational Science and Its Applications — ICCSA 2003;2003

3. Enumerating the Non-Isomorphic Assembly Configurations of Modular Robotic Systems;The International Journal of Robotics Research;1998-07

4. Random generation of colored trees;LATIN '95: Theoretical Informatics;1995

5. The generation of random, binary unordered trees;Journal of Classification;1984-12