The following pages link to (Q2748499):
Displaying 8 items.
- New constructions of SSPDs and their applications (Q419372) (← links)
- \(N\)-separators in planar graphs (Q661948) (← links)
- Embedding multidimensional grids into optimal hypercubes (Q740976) (← links)
- An experimental evaluation of local search heuristics for graph partitioning (Q1382773) (← links)
- Minimal congestion trees (Q1877665) (← links)
- The size and depth of layered Boolean circuits (Q1944075) (← links)
- Solution methods for the vertex variant of the network system vulnerability analysis problem (Q2017536) (← links)
- Separator-based graph embedding into multidimensional grids with small edge-congestion (Q2341722) (← links)
