Data-compression for parametrized counting problems on sparse graphs (Q5091010)
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: Data-compression for parametrized counting problems on sparse graphs |
scientific article; zbMATH DE number 7561374
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Data-compression for parametrized counting problems on sparse graphs |
scientific article; zbMATH DE number 7561374 |
Statements
21 July 2022
0 references
parameterized counting
0 references
compactor
0 references
protrusion decomposition
0 references
0 references
0.84564608335495
0 references
0.7797558903694153
0 references
0.7154423594474792
0 references
0.7109814882278442
0 references
0.7085240483283997
0 references
