Detection of common subtrees with identical label distribution

DOI10.1016/j.tcs.2023.114366arXiv2307.13068OpenAlexW4387865017MaRDI QIDQ6150674

Florian Ingels, Romain Azaïs

Publication date: 9 February 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

frequent pattern miningunordered treesDAG compressionmarked tree isomorphism

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of leaves in a random recursive tree
• Graph isomorphism is in the low hierarchy
• Reverse search for enumeration
• Isomorphic unordered labeled trees up to substitution ciphering
• Practical graph isomorphism. II.
• Enumeration of irredundant forests

This page was built for publication: Detection of common subtrees with identical label distribution