Efficiently covering complex networks with cliques of similar vertices (Q2368963): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2005.12.005 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2005.12.005 / rank | |||
Normal rank | |||
Latest revision as of 05:55, 18 December 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
0 references
