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 the normal view instead:
scientific article; zbMATH DE number 7116371
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for enumerating induced subgraphs with bounded degeneracy |
scientific article; zbMATH DE number 7116371 |
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
0.8651207089424133
0 references
0.8395693302154541
0 references
0.8143296241760254
0 references
0.8040059804916382
0 references
0.7998943328857422
0 references
