Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph (Q972337)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph |
scientific article; zbMATH DE number 5711868
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph |
scientific article; zbMATH DE number 5711868 |
Statements
Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph (English)
0 references
25 May 2010
0 references
graph algorithm
0 references
clique-separable graph
0 references
\(i\)-triangulated graph
0 references
tree decomposition
0 references
0 references
