Finding geometric representations of apex graphs is NP-hard (Q2154093)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding geometric representations of apex graphs is NP-hard |
scientific article |
Statements
Finding geometric representations of apex graphs is NP-hard (English)
0 references
13 July 2022
0 references
Hamiltonian path
0 references
planar graph
0 references
apex graph
0 references
\( \mathsf{NP} \)-hard
0 references
recognition problem
0 references
geometric intersection graph
0 references
VLSI design
0 references
1-STRING
0 references
PURE-2-DIR
0 references
0 references
0 references
0 references
0 references
