Isomorphic unordered labeled trees up to substitution ciphering

DOI10.1007/978-3-030-79987-8_27MaRDI QIDQ2115877zbMATH OpenOpenAlexFDO

Authors Florian Ingels, Romain Azaïs

Publication date 22 March 2022

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

zbMATH Keywords

labeled unordered treessubstitution ciphertree isomorphism

Mathematics Subject Classification ID

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

Cites work

• Algorithms on trees and graphs
• Constrained matching problems in bipartite graphs
• Graph isomorphism problem
• scientific article; zbMATH DE number 4007728 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Measuring the similarity of labeled graphs
• On the number of leaves in a random recursive tree
• On tree-constrained matchings and generalizations
• The weight function in the subtree kernel is decisive

Cited in

(2)

• Detection of common subtrees with identical label distribution
• Isomorphic unordered labeled trees up to substitution ciphering

Describes a project that uses

Uses Software

• treex

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115877)