A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs (Q5230321)
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: A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs |
scientific article; zbMATH DE number 7097027
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs |
scientific article; zbMATH DE number 7097027 |
Statements
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs (English)
0 references
22 August 2019
0 references
geometric intersection graphs
0 references
geometric separator
0 references
graph minors
0 references
subexponential algorithms
0 references
treewidth
0 references
