Finding and certifying a large hidden clique in a semirandom graph (Q4948021): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
Finding and certifying a large hidden clique in a semirandom graph | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/(sici)1098-2418(200003)16:2<195::aid-rsa5>3.0.co;2-a / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2078758709 / rank | |||
Normal rank | |||
| Property / title | |||
Finding and certifying a large hidden clique in a semirandom graph (English) | |||
| Property / title: Finding and certifying a large hidden clique in a semirandom graph (English) / rank | |||
Normal rank | |||
Revision as of 11:16, 30 July 2024
scientific article; zbMATH DE number 1436004
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding and certifying a large hidden clique in a semirandom graph |
scientific article; zbMATH DE number 1436004 |
Statements
13 July 2000
0 references
semirandom graph
0 references
largest clique
0 references
maximum clique problem
0 references
theta function
0 references
hidden clique
0 references
Finding and certifying a large hidden clique in a semirandom graph (English)
0 references
