Pages that link to "Item:Q2748499"
From MaRDI portal
The following pages link to Graph separators, with applications (Q2748499):
Displaying 19 items.
- New constructions of SSPDs and their applications (Q419372) (← links)
- Graph layouts via layered separators (Q473100) (← 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)
- The separator theorem for rooted directed vertex graphs (Q1850517) (← 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)
- Separators and adjustment sets in causal graphs: complete criteria and an algorithmic framework (Q2321275) (← links)
- Separator-based graph embedding into multidimensional grids with small edge-congestion (Q2341722) (← links)
- Segre's hemisystem and McLaughlin's graph (Q2427562) (← links)
- A near optimal algorithm for edge separators (preliminary version) (Q2817592) (← links)
- (Q3819101) (← links)
- Separator theorems and their applications (Q3972950) (← links)
- An approach to emulating separable graphs (Q4277376) (← links)
- (Q4873809) (← links)
- On finding separators in temporal split and permutation graphs (Q5918685) (← links)
- Finding minimum balanced separators -- an exact approach (Q6606653) (← links)