Journal article Open Access
{ "description": "<p>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 thematching number ofG. 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 has a unique perfect matching is studied in connection with reduction.</p>", "license": "https://creativecommons.org/licenses/by/4.0/legalcode", "creator": [ { "affiliation": "Department of Computer Science, Memorial University of Newfoundland", "@id": "https://orcid.org/0000-0002-0996-8769", "@type": "Person", "name": "Mikl\u00f3s Bartha" }, { "affiliation": "InnoRenew CoE; University of Primorska; University of Szeged", "@type": "Person", "name": "Mikl\u00f3s Kr\u00e9sz" } ], "headline": "On the K\u00f6nig deficiency of zero-reducible graphs", "image": "https://zenodo.org/static/img/logos/zenodo-gradient-round.svg", "datePublished": "2019-11-06", "url": "https://zenodo.org/record/3532849", "keywords": [ "Graph matching", "Independent set", "K\u00f6nig property", "Graph reduction", "Graph algorithm" ], "@context": "https://schema.org/", "identifier": "https://doi.org/10.1007/s10878-019-00466-2", "@id": "https://doi.org/10.1007/s10878-019-00466-2", "@type": "ScholarlyArticle", "name": "On the K\u00f6nig deficiency of zero-reducible graphs" }
Views | 71 |
Downloads | 90 |
Data volume | 56.0 MB |
Unique views | 67 |
Unique downloads | 88 |