𝔖 Bobbio Scriptorium
✦   LIBER   ✦

LD: A Polynomial Time Algorithm for Tree Isomorphism

✍ Scribed by Baida Zhang; Yuhua Tang; Junjie Wu; Shuai Xu

Book ID
119353947
Publisher
Elsevier
Year
2011
Tongue
English
Weight
640 KB
Volume
15
Category
Article
ISSN
1877-7058

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A polynomial time algorithm recognizing
A polynomial time algorithm recognizing link trees
✍ Peter Bugata; Attila Nagy; Roman VΓ‘vra πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 672 KB

The link of a vertex u of a graph G is the subgraph induced by all vertices adjacent to u . If all the links of G are isomorphic to a finite graph L, then G is called a realization of L, and L is called a link graph. At the Smolenice symposium of 1963, Zykov posed the problem of recognizing iink gr