Matching and Vertex Packing: How “hard” are They?-Reference-Cited by-同舟云学术

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

Matching and Vertex Packing: How “hard” are They?

Published:1993 Issue: Volume: Page:275-312
ISSN:0167-5060
Container-title:Quo Vadis, Graph Theory? - A Source Book for Challenges and Directions
language:
Short-container-title:

Author:

Plummer Michael D.

Publisher

Elsevier

Reference268 articles.

1. Matching Theory;Lovász,1986

2. M. D. Plummer, Matching theory — a sampler: from Dénes König to the present, preprint (1991)

3. Graphs and matrices;König;Mat. Fiz. Lapok,1931

4. Über trennende Knotenpunkte in Graphen (nebst Anwendungen auf Determinanten und Matrizen;König;Acta Sci. Math. (Szeged),1933

5. Über extreme Punkt- und Kantenmengen;Gallai;Ann. Univ. Sci. Budapest, Eötös Sect. Math.,1959

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

1. Generalized subgraph-restricted matchings in graphs;Discrete Mathematics;2005-04

2. Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases;RAIRO - Theoretical Informatics and Applications;2000-03

3. On the approximability of an interval scheduling problem;Journal of Scheduling;1999-09

4. An NC Algorithm for the Perfect Matching Problem in Larger cycle-free Graphs;Electronic Notes in Discrete Mathematics;1999-05

5. Approximating an interval scheduling problem;Approximation Algorithms for Combinatiorial Optimization;1998

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP