The following pages link to (Q2934632):
Displaying 11 items.
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- Volume in general metric spaces (Q464741) (← links)
- Finding the closest ultrametric (Q476304) (← links)
- The metric cutpoint partition problem (Q734378) (← links)
- An improved algorithm for computing all the best swap edges of a tree spanner (Q1986961) (← links)
- Average stretch factor: how low does it go? (Q2340408) (← links)
- New length bounds for cycle bases (Q2380021) (← links)
- Prioritized Metric Structures and Embedding (Q2941541) (← links)
- A Faster Computation of All the Best Swap Edges of a Tree Spanner (Q3460719) (← links)
- An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner (Q5136230) (← links)
- Lower bounds for strictly fundamental cycle bases in grid graphs (Q5191140) (← links)
