Tractabilities and intractabilities on geometric intersection graphs (Q1736543)
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: Tractabilities and intractabilities on geometric intersection graphs |
scientific article; zbMATH DE number 7042151
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tractabilities and intractabilities on geometric intersection graphs |
scientific article; zbMATH DE number 7042151 |
Statements
Tractabilities and intractabilities on geometric intersection graphs (English)
0 references
26 March 2019
0 references
Summary: A graph is said to be an intersection graph if there is a set of objects such that each vertex corresponds to an object and two vertices are adjacent if and only if the corresponding objects have a nonempty intersection. There are several natural graph classes that have geometric intersection representations. The geometric representations sometimes help to prove tractability/intractability of problems on graph classes. In this paper, we show some results proved by using geometric representations.
0 references
bandwidth
0 references
chain graphs
0 references
graph isomorphism
0 references
Hamiltonian path problem
0 references
interval graphs
0 references
threshold graphs
0 references
unit grid intersection graphs
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.89751303
0 references
0.89565325
0 references
0.8930032
0 references
0.88981545
0 references
0.88808465
0 references
0.88808465
0 references
0.88437396
0 references
0.88426995
0 references
