An algorithm for generating all maximal independent subsets of posets (Q1147517)
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: An algorithm for generating all maximal independent subsets of posets |
scientific article; zbMATH DE number 3703988
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for generating all maximal independent subsets of posets |
scientific article; zbMATH DE number 3703988 |
Statements
An algorithm for generating all maximal independent subsets of posets (English)
0 references
1981
0 references
algorithm
0 references
maximal independent subsets of posets
0 references
cliques
0 references
rooted tree
0 references
bipartite graphs
0 references
comparability graph
0 references
