Pages that link to "Item:Q410711"
From MaRDI portal
The following pages link to A metric for rooted trees with unlabeled vertices based on nested parentheses (Q410711):
Displaying 5 items.
- Two shortest path metrics on well-formed parentheses strings (Q286951) (← links)
- A distance metric on binary trees using lattice-theoretic measures (Q910191) (← links)
- Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete (Q1077168) (← links)
- Tree-Like Structures in Graphs: A Metric Point of View (Q2864284) (← links)
- Statistical limits of correlation detection in trees (Q6616873) (← links)