Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375)
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: Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations |
scientific article; zbMATH DE number 6201597
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations |
scientific article; zbMATH DE number 6201597 |
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
0 references
0 references
0.8200910091400146
0 references
0.818560004234314
0 references
0.7960991263389587
0 references
0.7881208062171936
0 references
0.7780407667160034
0 references
