Finding induced subgraphs via minimal triangulations (Q3113765)
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 5999712
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding induced subgraphs via minimal triangulations |
scientific article; zbMATH DE number 5999712 |
Statements
23 January 2012
0 references
bounded treewidth
0 references
minimal triangulation
0 references
moderately exponential time algorithms
0 references
Finding Induced Subgraphs via Minimal Triangulations (English)
0 references
0.8412392735481262
0 references
0.8184136748313904
0 references
0.7953143119812012
0 references
0.7879725098609924
0 references
0.7875383496284485
0 references
