The maximum weight \((\{K_1,K_2\},k,l)\)-packing problem in a graph (Q6152274)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The maximum weight (\Kâ,Kâ\,k,l)-packing problem in a graph |
scientific article; zbMATH DE number 7815491
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximum weight \((\{K_1,K_2\},k,l)\)-packing problem in a graph |
scientific article; zbMATH DE number 7815491 |
Statements
11 March 2024
0 references
graph packing
0 references
modular decomposition
0 references
induced matching
0 references
\(k\)-independent set
0 references
\(k\)-packing
0 references
0.8621199131011963
0 references
0.8533442616462708
0 references
0.8484004139900208
0 references
0.7745959758758545
0 references
