The following pages link to New length bounds for cycle bases (Q2380021):
Displaying 13 items.
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- Volume in general metric spaces (Q464741) (← links)
- Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← links)
- Minimum weakly fundamental cycle bases are hard to find (Q1024786) (← links)
- New length bounds for cycle bases (Q2380021) (← links)
- Rooted Cycle Bases (Q3449832) (← links)
- On a Special Co-cycle Basis of Graphs (Q3512471) (← links)
- Minimum Cycle Bases and Their Applications (Q3637310) (← links)
- Flow and Elastic Networks on the 𝑛-Torus: Geometry, Analysis, and Computation (Q5025736) (← links)
- Lower bounds for strictly fundamental cycle bases in grid graphs (Q5191140) (← links)
- Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion (Q5252661) (← links)
- Advances in metric embedding theory (Q5894374) (← links)
- Minimum spanning tree cycle intersection problem on outerplanar graphs (Q6180692) (← links)
