Efficient enumeration of maximal \(k\)-degenerate subgraphs in a chordal graph (Q2412406): 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.1007/978-3-319-62389-4_13 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2728920311 / rank | |||
Normal rank | |||
Latest revision as of 22:53, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient enumeration of maximal \(k\)-degenerate subgraphs in a chordal graph |
scientific article |
Statements
Efficient enumeration of maximal \(k\)-degenerate subgraphs in a chordal graph (English)
0 references
23 October 2017
0 references
\(n\)-vertex chordal graph
0 references
maximal independent sets
0 references
maximal induced forests
0 references
