Largest chordal and interval subgraphs faster than \(2^n\) (Q329301)
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 6642161
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Largest chordal and interval subgraphs faster than \(2^n\) |
scientific article; zbMATH DE number 6642161 |
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
0 references
0 references
0 references
0.995872676372528
0 references
0.8002455234527588
0 references
0.8002455234527588
0 references
0.7846853137016296
0 references
0.7832489013671875
0 references
