Methods of finding all minimum coverings of a graph by cliques (Q1903945): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:03, 1 February 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
