Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs (Q4895809): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q29396868, #quickstatements; #temporary_batch_1709545057628 |
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 / OpenAlex ID | |||
| Property / OpenAlex ID: W2125058377 / rank | |||
Normal rank | |||
Revision as of 01:38, 20 March 2024
scientific article; zbMATH DE number 936175
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs |
scientific article; zbMATH DE number 936175 |
Statements
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs (English)
0 references
11 May 1997
0 references
pathwidth
0 references
