Pages that link to "Item:Q4033768"
From MaRDI portal
The following pages link to Edge Separators of Planar and Outerplanar Graphs With Applications (Q4033768):
Displaying 17 items.
- Fast balanced partitioning is hard even on grids and trees (Q388790) (← links)
- Covering nearly surface-embedded graphs with a fixed number of balls (Q741614) (← links)
- A note on isoperimetric peaks of complete trees (Q966032) (← links)
- Optimal algorithms for broadcast and gossip in the edge-disjoint modes (Q1357008) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- On the complexity of multi-dimensional interval routing schemes (Q1575745) (← links)
- Wavelength routing in optical networks of diameter two (Q1612298) (← links)
- An external memory data structure for shortest path queries (Q1861568) (← links)
- An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs (Q2258080) (← links)
- Edge integrity of nearest neighbor graphs and separator theorems (Q2312806) (← links)
- Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area (Q4899278) (← links)
- Optimal algorithms for broadcast and gossip in the edge-disjoint path modes (Q5054763) (← links)
- Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs (Q5321706) (← links)
- BOUNDARY-OPTIMAL TRIANGULATION FLOODING (Q5470177) (← links)
- Drawing Planar Graphs with Reduced Height (Q5892364) (← links)
- On the design of efficient ATM routing schemes (Q5958312) (← links)
- Modularity of minor‐free graphs (Q6094045) (← links)
