Finding geometric representations of apex graphs is \textsf{NP}-hard (Q6175518)
From MaRDI portal
scientific article; zbMATH DE number 7729840
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding geometric representations of apex graphs is \textsf{NP}-hard |
scientific article; zbMATH DE number 7729840 |
Statements
Finding geometric representations of apex graphs is \textsf{NP}-hard (English)
0 references
18 August 2023
0 references
Hamiltonian path
0 references
planar graph
0 references
apex graph
0 references
\textsf{NP}-hard
0 references
recognition problem
0 references
geometric intersection graph
0 references
VLSI design
0 references
\textsc{1-String}
0 references
\textsc{Pure-2-Dir}
0 references
0 references
