Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph (Q1985603): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2018.08.009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2886539986 / rank | |||
Normal rank | |||
Latest revision as of 00:17, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph |
scientific article |
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
