Characterization of random walks on space of unordered trees using efficient metric simulation
From MaRDI portal
Publication:6069174
DOI10.1016/j.dam.2023.07.028arXiv2308.10861OpenAlexW4317939301MaRDI QIDQ6069174
Farah Ben-Naoum, Romain Azaïs, Christophe Godin
Publication date: 13 November 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2308.10861
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A survey on tree edit distance and related problems
- Exact algorithms for computing the tree edit distance between unordered trees
- On the editing distance between unordered labeled trees
- Random walks on graphs
- A constrained edit distance between unordered labeled trees
- Finding Minimum-Cost Circulations by Successive Approximation
- A Tree-to-Tree Distance and Its Application to Cluster Analysis
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Analyticity of the entropy and the escape rate of random walks in hyperbolic groups
- Approximation of trees by self-nested trees
This page was built for publication: Characterization of random walks on space of unordered trees using efficient metric simulation