A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges (Q2032181)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7360092
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges |
scientific article; zbMATH DE number 7360092 |
Statements
A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges (English)
0 references
16 June 2021
0 references
restricted 2-matching
0 references
triangle-free 2-matching
0 references
maximum weight \(b\)-matching
0 references
graph algorithms
0 references
half-edges
0 references
0 references
0 references
0.8437833189964294
0 references
0.8345487117767334
0 references
0.815062940120697
0 references
0.8140230178833008
0 references
0.8010593056678772
0 references
