Abstract
Abstract
A confluent and terminating reduction system is introduced for graphs, which preserves the number of their perfect matchings. A union-find algorithm is presented to carry out reduction in almost linear time. The König property is investigated in the context of reduction by introducing the König deficiency of a graph G as the difference between the vertex covering number and the matching number of G. It is shown that the problem of finding the König deficiency of a graph is NP-complete even if we know that the graph reduces to the empty graph. Finally, the König deficiency of graphs G having a vertex v such that $$G-v$$G-v has a unique perfect matching is studied in connection with reduction.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference18 articles.
1. Bartha M, Krész M (2006) Deterministic soliton graphs. Informatica 30:281–288
2. Bartha M, Krész M (2009) A depth-first algorithm to reduce graphs in linear time. In: Proceedings of the 11th international symposium on symbolic and numeric algorithms for scientific computing, Timisoara, Romania. IEEE Computer Society, pp 273–281
3. Bartha M, Krész M (2010) Efficient unique perfect matching algorithms. In: Proceedings of the 8th joint conference on mathematics and computer science, Komárno, Slovakia
4. Dershowitz N, Jouannaud J-P (1990) Rewrite systems. In: van Leeuwen J (ed) Handbook of theoretical computer science, vol B: formal models and semantics. Elsevier, Amsterdam, pp 245–320
5. Edmonds J (1965) Paths, trees and flowers. Can J Math 17:449–467
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献