A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges

We consider three variants of the problem of finding a maximum weight restricted \(2\)-matching in a subcubic graph \(G\). (A \(2\)-matching is any subset of the edges such that each vertex is incident to at most two of its edges.) Depending on the variant a restricted \(2\)-matching means a \(2\)-m...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2020-12
Hauptverfasser:	Paluch, Katarzyna, Wasylkiewicz, Mateusz
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Apexes Combinatorial analysis Graph matching Graph theory Polynomials Reduction Run time (computers) Set theory Triangles Weight Weights & measures
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!