Algorithms for Vertex Partitioning Problems on Partial k-Trees (Q4377448): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: DBLP publication ID (P1635): journals/siamdm/TelleP97, #quickstatements; #temporary_batch_1731547958265 |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q29301396 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1137/s0895480194275825 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2067264828 / rank | |||
Normal rank | |||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/siamdm/TelleP97 / rank | |||
Normal rank |
Latest revision as of 03:10, 14 November 2024
scientific article; zbMATH DE number 1116186
Language | Label | Description | Also known as |
---|---|---|---|
English | Algorithms for Vertex Partitioning Problems on Partial k-Trees |
scientific article; zbMATH DE number 1116186 |
Statements
Algorithms for Vertex Partitioning Problems on Partial k-Trees (English)
0 references
9 February 1998
0 references
treewidth
0 references
algorithms
0 references
implementations
0 references
graph partitioning
0 references