A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number (Q2034408)
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: A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number |
scientific article; zbMATH DE number 7361606
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number |
scientific article; zbMATH DE number 7361606 |
Statements
A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number (English)
0 references
22 June 2021
0 references
output-sensitive enumeration
0 references
independent set
0 references
binary partition
0 references
clique number
0 references
0 references
0 references
0 references
0 references
0 references
