Approximability results for the maximum and minimum maximal induced matching problems-Reference-Cited by-同舟云学术

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

Approximability results for the maximum and minimum maximal induced matching problems

Published:2008-08 Issue:3 Volume:5 Page:584-593
ISSN:1572-5286
Container-title:Discrete Optimization
language:en
Short-container-title:Discrete Optimization

Author:

Orlovich Yury,Finke Gerd,Gordon Valery,Zverovich Igor

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science

Reference36 articles.

1. Complexity and Approximation. Combinatorial Optimization Problems and Their Approximability Properties;Ausiello,1999

2. Graphs and Hypergraphs;Berge,1976

3. Graph Theory with Applications;Bondy,1976

4. Graph Classes: A Survey, SIAM Monographs on Discrete Mathematics and Applications;Brandstädt,1999

5. Independent sets in asteroidal triple-free graphs;Broersma;SIAM J. Discrete Math.,1999

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

1. On the complexity of minimum maximal acyclic matchings;Journal of Combinatorial Optimization;2024-08

2. Minimum Maximal Acyclic Matching in Proper Interval Graphs;Algorithms and Discrete Applied Mathematics;2023

3. Структурные и алгоритмические свойства максимальных диссоциирующих множеств в графах;Trudy Instituta Matematiki i Mekhaniki UrO RAN;2022-06

4. On the Complexity of Minimum Maximal Acyclic Matchings;Lecture Notes in Computer Science;2022

5. On Two Variants of Induced Matchings;Communications in Computer and Information Science;2022

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP