Pages that link to "Item:Q3358265"
From MaRDI portal
The following pages link to Spanning trees with low crossing number (Q3358265):
Displaying 13 items.
- Optimal partition trees (Q420575) (← links)
- Range searching with efficient hierarchical cuttings (Q685179) (← links)
- Partitioning arrangements of lines. II: Applications (Q921915) (← links)
- Tight bounds for connecting sites across barriers (Q958235) (← links)
- Minimizing the stabbing number of matchings, trees, and triangulations (Q1006396) (← links)
- Applications of a new space-partitioning technique (Q1196362) (← links)
- Implicitly representing arrangements of lines or segments (Q1263966) (← links)
- Spanning trees crossing few barriers (Q1422228) (← links)
- Low degree spanning trees of small weight (Q2817632) (← links)
- Lower-stretch spanning trees (Q3581444) (← links)
- (Q4437490) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313046) (← links)