Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: DIMACS / rank | |||
Normal rank | |||
Revision as of 03:32, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations |
scientific article |
Statements
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (English)
0 references
26 August 2013
0 references
Russian doll search
0 references
clique relaxations
0 references
\(s\)-plex
0 references
\(s\)-defective clique
0 references
