On Maximum Edge Cuts of Connected Digraphs
Author:
Affiliation:
1. DEPARTMENT OF MATHEMATICS AND STATISTICS; GEORGIA STATE UNIVERSITY; ATLANTA GA 30303
2. DEPARTMENT OF APPLIED MATHEMATICS; SHANGHAI UNIVERSITY OF FINANCE AND ECONOMICS; SHANGHAI 200433 CHINA
Publisher
Wiley
Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Link
http://onlinelibrary.wiley.com/wol1/doi/10.1002/jgt.21746/fullpdf
Reference7 articles.
1. Maximum directed cuts in acyclic digraphs;Alon;J Graph Theory,2007
2. Largest bipartite subgraphs in triangle-free graphs with maximum degree three;Bondy;J Graph Theory,1986
3. The hall-ratio of graphs and hypergraphs;Cropper;Les Cahiers du Laboratoire Leibniz,2000
4. Maximum directed cuts in digraphs with degree restriction;Lehel;J Graph Theory,2009
5. Optimization, approximation, and complexity classes;Papadimitriou;J Comput System Sci,1991
Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bounds on Maximum Weight Directed Cut;SIAM Journal on Discrete Mathematics;2024-08-29
2. Graph partitioning: an updated survey;AKCE International Journal of Graphs and Combinatorics;2022-11-22
3. Emerging From the “Ku:” Fluctuating in Adjusting With Breast Cancer—A Post-Traumatic Growth Theory Situated Within Chinese Culture;Qualitative Health Research;2020-06-20
4. Seismic modelling for reservoir studies: a comparison between convolutional and full‐waveform methods for a deep‐water turbidite sandstone reservoir;Geophysical Prospecting;2020-03-04
5. A bound on judicious bipartitions of directed graphs;Science China Mathematics;2019-01-22
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3