Compactness-preserving mapping on trees

DOI10.1007/978-3-319-07566-2_17MaRDI QIDQ5165602zbMATH OpenOpenAlexWikidataFDO

Authors Jan Baumbach, Jiong Guo, Rashid Ibragimov

Publication date 30 June 2014

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-07566-2_17

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Neighborhood-preserving mapping between trees
• A dynamic programming algorithm for the tree mapping problem
• Isomorphism of (mis)Labeled Graphs
• scientific article; zbMATH DE number 3904629
• Optimal mappings with minimum number of connected components in tree-to-tree comparison problems

Cited in

(4)

• On Lipschitz compactifications of trees
• Neighborhood-preserving mapping between trees
• A dynamic programming algorithm for the tree mapping problem
• On expansive and anti-expansive tree maps

This page was built for publication: Compactness-preserving mapping on trees

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