Skip to main content
main-content

Tipp

Weitere Artikel dieser Ausgabe durch Wischen aufrufen

06.11.2019 | Ausgabe 1/2020 Open Access

Journal of Combinatorial Optimization 1/2020

On the König deficiency of zero-reducible graphs

Zeitschrift:
Journal of Combinatorial Optimization > Ausgabe 1/2020
Autoren:
Miklós Bartha, Miklós Krész
Wichtige Hinweise
The second author acknowledges the European Commission for funding the InnoRenew CoE project (Grant Agreement #739574) under the Horizon2020 Widespread-Teaming program and the Republic of Slovenia (Investment funding of the Republic of Slovenia and the European Union of the European regional Development Fund). Miklós Krész is also grateful for the support of the EU-funded Hungarian grant EFOP-3.6.2-16-2017-00015 and the Slovenian ARRS grant J1-9110.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

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\) has a unique perfect matching is studied in connection with reduction.

Unsere Produktempfehlungen

Premium-Abo der Gesellschaft für Informatik

Sie erhalten uneingeschränkten Vollzugriff auf alle acht Fachgebiete von Springer Professional und damit auf über 45.000 Fachbücher und ca. 300 Fachzeitschriften.

Literatur
Über diesen Artikel

Weitere Artikel der Ausgabe 1/2020

Journal of Combinatorial Optimization 1/2020 Zur Ausgabe

Premium Partner

    Bildnachweise