Deciding whether a grid is a topological subgraph of a planar graph is NP-complete (Q5896079)
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 7218781
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deciding whether a grid is a topological subgraph of a planar graph is NP-complete |
scientific article; zbMATH DE number 7218781 |
Statements
Deciding whether a grid is a topological subgraph of a planar graph is NP-complete (English)
0 references
8 July 2020
0 references
topological subgraph
0 references
subgraph homeomorphism
0 references
subdivision
0 references
grids
0 references
planar graph
0 references
NP-completeness
0 references
0.7784419655799866
0 references
0.7403815388679504
0 references
0.7195667028427124
0 references
0.7154639363288879
0 references
