A note on the problem of reporting maximal cliques (Q955035): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 457 / rank | |||
Normal rank | |||
Revision as of 13:35, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the problem of reporting maximal cliques |
scientific article |
Statements
A note on the problem of reporting maximal cliques (English)
0 references
18 November 2008
0 references
maximal cliques
0 references
output sensitive algorithms
0 references
maximal common subgraphs
0 references
enumeration problems
0 references
