Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph (Q1985603)
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: Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph |
scientific article; zbMATH DE number 7187631
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph |
scientific article; zbMATH DE number 7187631 |
Statements
Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph (English)
0 references
7 April 2020
0 references
graph enumeration
0 references
graph algorithms
0 references
polynomial delay
0 references
degeneracy
0 references
chordal graphs
0 references
clique trees
0 references
0 references
0.9619807600975036
0 references
0.8395693302154541
0 references
0.825714111328125
0 references
0.8038792014122009
0 references
0.7895014882087708
0 references
