Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659)
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: Beyond classes of graphs with ``few minimal separators: FPT results through potential maximal cliques |
scientific article; zbMATH DE number 7034488
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques |
scientific article; zbMATH DE number 7034488 |
Statements
Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (English)
0 references
11 March 2019
0 references
FPT algorithms
0 references
treewidth
0 references
potential maximal cliques
0 references
0 references
0 references
