A fast and effective heuristic for the feedback arc set problem

Author:

Eades Peter,Lin Xuemin,Smyth W.F.

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference11 articles.

1. Approximation algorithms for the maximum acyclic subgraph problem;Berger;Proc. First ACM-SIAM Symp. on Discrete Algorithms,1990

2. On the maximum cardinality of a consistent set of arcs in a random tournament;de la Vega;J. Combin. Theory Ser. B,1983

3. Heuristics for the feedback arc set problem;Eades,1989

4. On sets of consistent arcs in tournaments;Erdös;Canad. Math. Bull.,1965

5. On subgraphs without cycles in tournaments;Jung,1970

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

1. Finding small feedback arc sets on large graphs;Computers & Operations Research;2024-09

2. A layout framework for genome-wide multiple sequence alignment graphs;Frontiers in Bioinformatics;2024-08-16

3. Determining the Minimum Number of Virtual Networks for Different Coherence Protocols;2024 ACM/IEEE 51st Annual International Symposium on Computer Architecture (ISCA);2024-06-29

4. A Bayesian network method using transfer learning for solving small data problems in abnormal condition diagnosis of fused magnesia smelting process;Control Engineering Practice;2024-06

5. Connectivity Matrix Seriation via Relaxation;PLOS Computational Biology;2024-02-20

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3