Minimum <scp>color‐degree</scp> perfect <i>b</i>‐matchings (Q6087129)
From MaRDI portal
!
WARNING
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 7775305
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum <scp>color‐degree</scp> perfect <i>b</i>‐matchings |
scientific article; zbMATH DE number 7775305 |
Statements
Minimum <scp>color‐degree</scp> perfect <i>b</i>‐matchings (English)
0 references
11 December 2023
0 references
bounded treewidth
0 references
complexity
0 references
dynamic programming
0 references
edge-colored graph
0 references
\(b\)-matching
0 references
series-parallel graph
0 references
0.821378231048584
0 references
0.8160508871078491
0 references
0.8095797896385193
0 references
0.7964122891426086
0 references
0.7868666648864746
0 references
