Algorithmic height compression of unordered trees

DOI10.1016/j.jtbi.2015.10.030zbMath1343.92287OpenAlexW2100296510WikidataQ47348530 ScholiaQ47348530MaRDI QIDQ304776

Farah Ben-Naoum, Christophe Godin

Publication date: 26 August 2016

Published in: Journal of Theoretical Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jtbi.2015.10.030

zbMATH Keywords

branching structuresheight redundancyplants modelingquasi-isomorphismself-nestedness

Mathematics Subject Classification ID

Applications of graph theory (05C90) Plant biology (92C80)

Cites Work

• Solving the maximum clique problem using a tabu search approach
• SELF-SIMILARITY IN PLANTS: INTEGRATING MATHEMATICAL AND BIOLOGICAL PERSPECTIVES
• Approximating Maximum Clique by Removing Subgraphs
• Reactive local search for the maximum clique problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithmic height compression of unordered trees