Канонический код дерева

Authors

  • Dmitry Pavlov

Keywords:

канонический код, каноническая нумерация, изоморфизм графов, изоморфизм деревьев

Abstract

Canonical code is the notation for the graph structure, which is invariant to isomorphism. The article briefly illustrates the significance of canonical codes in general, and reveals some connection of the canonical code building to other problems common to computer science. A linear-time algorithm for calculating the canonical code of a colored tree is presented. The algorithm is based on widely known procedure of tree isomorphism detection.

Downloads

Published

2009-04-30

Issue

No. 2 (2009)

Section

Computer science

License

Public offer

How to Cite

[1]
“Канонический код дерева”, Comput. Tools Educ., no. 2, Apr. 2009, Accessed: Oct. 24, 2026. Available: http://cte.eltech.ru/ojs/index.php/kio/article/view/1173

Most read articles by the same author(s)