An efficient algorithm for enumerating induced subgraphs with bounded degeneracy (Q2327103)
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 for enumerating induced subgraphs with bounded degeneracy |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for enumerating induced subgraphs with bounded degeneracy |
scientific article |
Statements
An efficient algorithm for enumerating induced subgraphs with bounded degeneracy (English)
0 references
11 October 2019
0 references
graph algorithms
0 references
enumeration algorithms
0 references
polynomial delay
0 references
\(k\)-degenerate graphs
0 references
