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

An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover

  • Published:2001-02 Issue:2 Volume:38 Page:374-410
  • ISSN:0196-6774
  • Container-title:Journal of Algorithms
  • language:en
  • Short-container-title:Journal of Algorithms

Author:

Fernau Henning,Niedermeier Rolf

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference49 articles.

1. Fault tolerance techniques for systolic arrays;Abraham;IEEE Comput.,1987

2. Fixed parameter algorithms for planar dominating set and related problems;Alber,2000

3. J. Alber, J. Gramm, and, R. Niedermeier, Faster exact solutions for hard problems: A parameterized point of view, Disc. Math, in press.

4. Computing a maximum cardinality matching in a bipartite graph in time o(n1.5m/logn);Alt;Inform. Processs. Lett.,1991

5. An improved fixed parameter algorithm for vertex cover;Balasubramanian;Inform. Processs. Lett.,1998

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

1. An Interactive Application for Learning and Analyzing Different Graph Vertex Cover Algorithms;International Journal of Engineering Pedagogy (iJEP);2023-02-16

2. Linear-time algorithm for generating c-isolated bicliques;International Journal of Computer Mathematics;2016-09-26

3. Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight;LEIBNIZ INT PR INFOR;2016

4. Worst-Case Analysis of Process Flexibility Designs;Operations Research;2015-02

5. An exact exponential time algorithm for counting bipartite cliques;Information Processing Letters;2012-07
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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