Efficiently covering complex networks with cliques of similar vertices (Q2368963): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2005.12.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1968481794 / rank | |||
Normal rank | |||
Revision as of 02:00, 20 March 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
