A new edge selection heuristic for computing the Tutte polynomial of an undirected graph (Q5377432)
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 7058739
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new edge selection heuristic for computing the Tutte polynomial of an undirected graph |
scientific article; zbMATH DE number 7058739 |
Statements
24 May 2019
0 references
Tutte polynomials
0 references
edge deletion and contraction algorithms
0 references
NP-hard problems
0 references
0.8580496907234192
0 references
0.834211528301239
0 references
0.7862333655357361
0 references
0.7732052803039551
0 references
