Computing unique maximum matchings in $$O(m)$$ O ( m ) time for König–Egerváry graphs and unicyclic graphs-Reference-Cited by-同舟云学术

Computing unique maximum matchings in $$O(m)$$ O ( m ) time for König–Egerváry graphs and unicyclic graphs

Published:2015-04-17 Issue:1 Volume:32 Page:267-277
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Levit Vadim E.,Mandrescu Eugen

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-015-9875-9.pdf

Reference35 articles.

1. Bartha M (2010) Efficient unique perfect matching algorithms. In: Proceedings of the 8th joint conference on mathematics and computer science, Komárno, Slovakia

2. Bartha M, Krész M (2009) A depth-first algorithm to reduce graphs in linear time, In: Proceedings of 11th international symposium on symbolic and numeric algorithms for scientific computing, Timisoara, Romania. IEEE Computing Society, pp. 273–281

3. Bartha M, Krész M (2009) Deciding the deterministic property for soliton graphs. Ars Mathematica Contemporanea 2:121–136

4. Belardo F, Li M, Enzo M, Simić SK, Wang J (2010) On the spectral radius of unicyclic graphs with prescribed degree sequence. Linear Algebra Appl 432:2323–2334

5. Cechlárová K (1991) The uniquely solvable bipartite matching problem. Oper Res Lett 10:221–224

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

1. On the König deficiency of zero-reducible graphs;Journal of Combinatorial Optimization;2019-11-06

2. On some graphs with a unique perfect matching;Information Processing Letters;2018-11

3. Combinatorial and spectral properties of König–Egerváry graphs;Discrete Applied Mathematics;2017-01