Heuristics for finding \(k\)-clubs in an undirected graph (Q1977620)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1448734
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristics for finding \(k\)-clubs in an undirected graph |
scientific article; zbMATH DE number 1448734 |
Statements
Heuristics for finding \(k\)-clubs in an undirected graph (English)
0 references
4 March 2001
0 references
undirected graph
0 references
\(k\)-clubs
0 references
\(k\)-cliques
0 references
heuristics
0 references
0.93319213
0 references
0.9116523
0 references
0.9081999
0 references
0.90751386
0 references
0.8873057
0 references
0 references
0.87695855
0 references
0.87335193
0 references
0.8726891
0 references
