An extended tree-width notion for directed graphs related to the computation of permanents (Q2254501)
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 6398310
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An extended tree-width notion for directed graphs related to the computation of permanents |
scientific article; zbMATH DE number 6398310 |
Statements
An extended tree-width notion for directed graphs related to the computation of permanents (English)
0 references
5 February 2015
0 references
treewidth notions for digraphs
0 references
efficient algorithms
0 references
computation of the permanent
0 references
0 references
0 references
0.997627854347229
0 references
0.7801848649978638
0 references
0.769555389881134
0 references
0.7663229703903198
0 references
