Optimal bisections of directed graphs
From MaRDI portal
Publication:6185053
DOI10.1002/rsa.21175zbMath1529.05133arXiv2302.04050OpenAlexW4385492795MaRDI QIDQ6185053
Jie Ma, Guanwu Liu, Chunlei Zu
Publication date: 5 January 2024
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.04050
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Unnamed Item
- On judicious partitions of uniform hypergraphs
- On judicious bisections of graphs
- Bisections of graphs
- Judicious partitions of uniform hypergraphs
- On several partitioning problems of Bollobás and Scott
- Bipartitions of oriented graphs
- Partitioning 3-uniform hypergraphs
- On a bottleneck bipartition conjecture of Erdős
- Judicious partitions of hypergraphs
- Maximum cuts and judicious partitions in graphs without short cycles
- Judicious partitions of 3-uniform hypergraphs
- Exact bounds for judicious partitions of graphs
- On bipartitions of directed graphs with small semidegree
- On judicious bipartitions of directed graphs
- Maximum bisections of graphs without short even cycles
- A bound on judicious bipartitions of directed graphs
- On bisections of directed graphs
- The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs
- Weighted sums of certain dependent random variables
- Bipartite subgraphs
- Bounds for pairs in judicious partitioning of graphs
- Maximum directed cuts in acyclic digraphs
- Judicious partitions of directed graphs
- Judicious partitions of bounded‐degree graphs
- Bisections of Graphs Without Short Cycles
- Problems and results on judicious partitions
- Judiciously 3‐partitioning 3‐uniform hypergraphs
- Better Bounds for k-Partitions of Graphs
- Probability Inequalities for Sums of Bounded Random Variables
- Some Extremal Properties of Bipartite Subgraphs
- On judicious bipartitions of graphs
- Partitioning digraphs with outdegree at least 4
- On bisections of graphs without complete bipartite graphs
- Graph partitioning: an updated survey
This page was built for publication: Optimal bisections of directed graphs
