Covering graphs with convex sets and partitioning graphs into convex sets (Q2308465)
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 7185188
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Covering graphs with convex sets and partitioning graphs into convex sets |
scientific article; zbMATH DE number 7185188 |
Statements
Covering graphs with convex sets and partitioning graphs into convex sets (English)
0 references
3 April 2020
0 references
computational complexity
0 references
convex \(p\)-cover
0 references
convex \(p\)-partition
0 references
0.8760583400726318
0 references
0.8683022856712341
0 references
0.8498126864433289
0 references
0.8476670384407043
0 references
0.8224058747291565
0 references
