Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-018-0453-2 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-018-0453-2 / rank | |||
Normal rank | |||
Revision as of 06:46, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques |
scientific article |
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
