Methods of finding all minimum coverings of a graph by cliques (Q1903945): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 06:11, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Methods of finding all minimum coverings of a graph by cliques |
scientific article |
Statements
Methods of finding all minimum coverings of a graph by cliques (English)
0 references
7 March 1996
0 references
bichromatic graph algorithm
0 references
scanning methods
0 references
