Computing the Tutte Polynomial on Graphs of Bounded Clique‐Width (Q5426882): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/050645208 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3021394452 / rank | |||
Normal rank | |||
Latest revision as of 20:05, 19 March 2024
scientific article; zbMATH DE number 5212477
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the Tutte Polynomial on Graphs of Bounded Clique‐Width |
scientific article; zbMATH DE number 5212477 |
Statements
Computing the Tutte Polynomial on Graphs of Bounded Clique‐Width (English)
0 references
16 November 2007
0 references
Tutte polynomial
0 references
cographs
0 references
clique-width
0 references
subexponential algorithm
0 references
\(U\) polynomial
0 references
