Largest chordal and interval subgraphs faster than \(2^n\) (Q329301)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Largest chordal and interval subgraphs faster than \(2^n\) |
scientific article |
Statements
Largest chordal and interval subgraphs faster than \(2^n\) (English)
0 references
21 October 2016
0 references
exact exponential algorithms
0 references
chordal graphs
0 references
interval graphs
0 references
maximum induced \(\Pi\)-subgraph
0 references
