An algorithm for the decomposition of graphs into cliques (Q4852404): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.3190200208 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2070599422 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Representation of a Graph by Set Intersections / rank | |||
Normal rank | |||
Latest revision as of 16:58, 23 May 2024
scientific article; zbMATH DE number 811253
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for the decomposition of graphs into cliques |
scientific article; zbMATH DE number 811253 |
Statements
An algorithm for the decomposition of graphs into cliques (English)
0 references
31 October 1995
0 references
polynomial time algorithm
0 references
decomposition
0 references
cliques
0 references
