Exact Algorithms for Treewidth and Minimum Fill-In (Q3631902): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q60488730, #quickstatements; #temporary_batch_1706301185450 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2038049091 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:08, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact Algorithms for Treewidth and Minimum Fill-In |
scientific article |
Statements
Exact Algorithms for Treewidth and Minimum Fill-In (English)
0 references
22 June 2009
0 references
exact exponential algorithm
0 references
treewidth
0 references
fill-in
0 references
minimal separators
0 references
potential maximal clique
0 references
minimal triangulation
0 references
