An efficient algorithm to generate all maximal independent sets on trapezoid graphs (Q4240618)
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 efficient algorithm to generate all maximal independent sets on trapezoid graphs |
scientific article; zbMATH DE number 1281321
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm to generate all maximal independent sets on trapezoid graphs |
scientific article; zbMATH DE number 1281321 |
Statements
An efficient algorithm to generate all maximal independent sets on trapezoid graphs (English)
0 references
25 October 1999
0 references
maximal independent sets
0 references
0 references
0 references
0 references
0 references
0.824161171913147
0 references
0.7998910546302795
0 references
0.7837995290756226
0 references
0.7835155129432678
0 references
0.7834169864654541
0 references
