Weakly bipartite graphs and the Max-cut problem-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Weakly bipartite graphs and the Max-cut problem

Published:1981-10 Issue:1 Volume:1 Page:23-27
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Grötschel M.,Pulleyblank W.R.

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference10 articles.

1. Sur la complexité du problemè du verre de spins;Barahona,1979

2. On the complexity of max cut;Barahona,1980

3. Balancing signed graphs of fixed genus in polynomial time;Barahona,1981

4. Maximum matching and a polyhedron with (0,1)-vertices;Edmonds;J. Res. Nat. Bur. Standards,1965

5. On determining the genus of a graph in O(VO(g)) steps;Filotti,1978

Cited by 138 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Shortest odd paths in undirected graphs with conservative weight functions;Discrete Applied Mathematics;2024-11

2. Low-depth Clifford circuits approximately solve MaxCut;Physical Review Research;2024-06-20

3. General spatial photonic Ising machine based on the interaction matrix eigendecomposition method;Applied Optics;2024-04-08

4. The Shortest Even Cycle Problem Is Tractable;SIAM Journal on Computing;2024-02-15

5. Stable Set Problem: Branch & Cut Algorithms;Encyclopedia of Optimization;2024

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP