Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10589-013-9548-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2005863517 / rank | |||
Normal rank | |||
Revision as of 22:51, 19 March 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
