Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In (Q3525813)
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 5345320
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In |
scientific article; zbMATH DE number 5345320 |
Statements
Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In (English)
0 references
18 September 2008
0 references
0.9087706208229064
0 references
0.8911834955215454
0 references
0.8172839283943176
0 references
0.8113337755203247
0 references
0.8101950287818909
0 references
