Pages that link to "Item:Q5190331"
From MaRDI portal
The following pages link to Balanced judicious bipartitions of graphs (Q5190331):
Displayed 19 items.
- Judicious bisection of hypergraphs (Q287970) (← links)
- Judicious partitions of weighted hypergraphs (Q295108) (← links)
- On judicious bisections of graphs (Q402590) (← links)
- Upper bounds on minimum balanced bipartitions (Q409437) (← links)
- A note on balanced bipartitions (Q709305) (← links)
- Simple probabilistic analysis to generalize bottleneck graph multi-partitioning (Q714518) (← links)
- Bipartitions of oriented graphs (Q723882) (← links)
- Bisections of graphs without \(K_{2, l}\) (Q1735680) (← links)
- Bounds for judicious balanced bipartitions of graphs (Q1756085) (← links)
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
- On judicious bipartitions of directed graphs (Q2144584) (← links)
- On bisections of directed graphs (Q2357220) (← links)
- Bipartition of graph under degree constraints (Q2515316) (← links)
- Biased partitions and judicious \(k\)-partitions of graphs (Q2627880) (← links)
- Bisections of Graphs Without Short Cycles (Q4601051) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5136332) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5238741) (← links)
- On bisections of graphs without complete bipartite graphs (Q6056762) (← links)
- Graph partitioning: an updated survey (Q6110873) (← links)