Non-shared edges and nearest neighbor interchanges revisited
From MaRDI portal
Publication:2390296
DOI10.1016/J.IPL.2004.04.003zbMATH Open1192.68905OpenAlexW2063145675WikidataQ58063024 ScholiaQ58063024MaRDI QIDQ2390296FDOQ2390296
Authors: Wing-Kai Hon, Ming-Yang Kao, Wing-Kin Sung, S. M. Yiu, Tak-Wah Lam 
Publication date: 21 July 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2004.04.003
Recommendations
- Edge integrity of nearest neighbor graphs and separator theorems
- scientific article; zbMATH DE number 1782221
- Graphs of edge-intersecting and non-splitting paths
- scientific article; zbMATH DE number 2079393
- Edge-disjoint paths revisited
- scientific article; zbMATH DE number 6131331
- A neigborhood union condition for nonadjacent vertices in graphs
- On nearest-neighbor graphs
- On nearest-neighbor graphs
Cites Work
- Comparison of phylogenetic trees
- Fast Algorithms for Finding Nearest Common Ancestors
- Optimal algorithms for comparing trees with labeled leaves
- Title not available (Why is that?)
- Comparison of labeled trees with valency three
- Approximating the nearest neighbor intercharge distance for non-uniform-degree evolutionary trees
Cited In (5)
- A computationally efficient approximation to the nearest neighbor interchange metric
- On computing the nearest neighbor interchange distance
- Title not available (Why is that?)
- Approximating the nearest neighbor intercharge distance for non-uniform-degree evolutionary trees
- Fast algorithms for computing the tripartition-based distance between phylogenetic networks
This page was built for publication: Non-shared edges and nearest neighbor interchanges revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390296)
