MAX for \(k\)-independence in multigraphs (Q2312650)
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 7081365
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | MAX for \(k\)-independence in multigraphs |
scientific article; zbMATH DE number 7081365 |
Statements
MAX for \(k\)-independence in multigraphs (English)
0 references
17 July 2019
0 references
\(k\)-independent set
0 references
MAX algorithm
0 references
pair covering
0 references
0 references
0.7702805995941162
0 references
0.7674702405929565
0 references
0.7620728015899658
0 references
0.7582271099090576
0 references
0.7555883526802063
0 references
