Finding cliques and dense subgraphs using edge queries (Q6454589)
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: Finding cliques and dense subgraphs using edge queries |
scientific article; zbMATH DE number 902342579
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding cliques and dense subgraphs using edge queries |
scientific article; zbMATH DE number 902342579 |
Statements
10 October 2023
0 references
math.CO
0 references
cs.DM
0 references
