Efficiently covering complex networks with cliques of similar vertices (Q2368963): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: COSMOS / rank | |||
Normal rank | |||
Revision as of 06:41, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficiently covering complex networks with cliques of similar vertices |
scientific article |
Statements
Efficiently covering complex networks with cliques of similar vertices (English)
0 references
28 April 2006
0 references
Random graphs
0 references
Intersection graphs
0 references
Clique cover algorithm
0 references
