Isomorphic unordered labeled trees up to substitution ciphering

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

Authors: 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph isomorphism problem
• Title not available (Why is that?)
• Constrained matching problems in bipartite graphs
• Title not available (Why is that?)
• 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

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)