Methods of finding all minimum coverings of a graph by cliques (Q1903945)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Methods of finding all minimum coverings of a graph by cliques |
scientific article; zbMATH DE number 825961
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Methods of finding all minimum coverings of a graph by cliques |
scientific article; zbMATH DE number 825961 |
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
