Isomorphic unordered labeled trees up to substitution ciphering

DOI10.1007/978-3-030-79987-8_27OpenAlexW3184803410MaRDI QIDQ2115877

Florian Ingels, Romain Azaïs

Publication date: 22 March 2022

Full work available at URL: https://arxiv.org/abs/2105.05685

zbMATH Keywords

tree isomorphismsubstitution cipherlabeled unordered trees

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

Detection of common subtrees with identical label distribution

Uses Software

• treex

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of leaves in a random recursive tree
• Graph isomorphism problem
• On tree-constrained matchings and generalizations
• Constrained Matching Problems in Bipartite Graphs

This page was built for publication: Isomorphic unordered labeled trees up to substitution ciphering