An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs (Q3147308)
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: An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs |
scientific article; zbMATH DE number 1802854
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs |
scientific article; zbMATH DE number 1802854 |
Statements
An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs (English)
0 references
11 December 2002
0 references
maximal clique
0 references
trapezoid graph
0 references
algorithm
0 references
0 references
0 references
0.824161171913147
0 references
0.8229420781135559
0 references
0.8185980916023254
0 references
0.7842983603477478
0 references
0.7592430114746094
0 references
