A bound on judicious bipartitions of directed graphs
- 4 Downloads
Keywordsdirected graph partition outdegree indegree tight component
Unable to display preview. Download preview PDF.
The first author was supported by National Natural Science Foundation of China (Grant No. 11671087). The third author was supported by National Science Foundation of USA (Grant No. DMS-1600738) and the Hundred Talents Program of Fujian Province. The fourth author was supported by the Shandong Provincial Natural Science Foundation of China (Grant No. ZR2014JL001) and the Excellent Young Scholars Research Fund of Shandong Normal University of China. The authors thank the anonymous referees for their helpful comments and suggestions.
- 8.Edwards C S. An improved lower bound for the number of edges in a largest bipartite subgraph. In: Recent Advances in Graph Theory. Proceedings of the 2nd Czechoslovak Symposium on Graph Theory. Prague: Czechoslovak Academy of Sciences, 1975, 167–181Google Scholar
- 25.Yannakakis M. Node- and edge-deletion NP-complete problems. STOC, 1978, 253–264Google Scholar