On generating triangle-free graphs (Q2839211)
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: On generating triangle-free graphs |
scientific article; zbMATH DE number 6184189
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On generating triangle-free graphs |
scientific article; zbMATH DE number 6184189 |
Statements
4 July 2013
0 references
NP-complete problem
0 references
parameterized algorithmics
0 references
kernelization
0 references
On generating triangle-free graphs (English)
0 references
0.8373159170150757
0 references
0.7972843050956726
0 references
0.7952744960784912
0 references
0.7918700575828552
0 references
0.783661961555481
0 references
