On some hard and some tractable cases of the maximum acyclic matching problem-Reference-Cited by-同舟云学术

On some hard and some tractable cases of the maximum acyclic matching problem

Published:2019-07-31 Issue:1-2 Volume:279 Page:291-300
ISSN:0254-5330
Container-title:Annals of Operations Research
language:en
Short-container-title:Ann Oper Res

Author:

Fürst M.,Rautenbach D.

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Decision Sciences

Link

http://link.springer.com/content/pdf/10.1007/s10479-019-03311-1.pdf

Reference26 articles.

1. Agrawal, A., Gupta, S., Saurabh, S., & Sharma, R. (2017). Improved algorithms and combinatorial bounds for independent feedback vertex set. Leibniz International Proceedings in Informatics, 63, 2:1–2:14.

2. Baste, J., & Rautenbach, D. (2018). Degenerate matchings and edge colorings. Discrete Applied Mathematics, 239, 38–44.

3. Bonamy, M. Dabrowski, K. K., Feghali, C., Johnson, M., & Paulusma, D. (2017). Independent feedback vertex set for $$P_5$$-free graphs. arXiv:1707.09402 .

4. Brandstädt, A., & Mosca, R. (2011). On distance-$$3$$ matchings and induced matchings. Discrete Applied Mathematics, 159, 509–520.

5. Cameron, K. (1989). Induced matchings. Discrete Applied Mathematics, 24, 97–102.

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

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

2. Utilizing Acyclic Matching for Enhancing Current flow in Diamond Ladder Structures;2023 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS);2023-12-17

3. Matchings under distance constraints II.;Annals of Operations Research;2023-12-07

4. On the parameterized complexity of the acyclic matching problem;Theoretical Computer Science;2023-05

5. Acyclic matching in some subclasses of graphs;Theoretical Computer Science;2023-01