A polynomial-time algorithm to find a linkless embedding of a graph (Q1003855)
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 polynomial-time algorithm to find a linkless embedding of a graph |
scientific article; zbMATH DE number 5523287
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm to find a linkless embedding of a graph |
scientific article; zbMATH DE number 5523287 |
Statements
A polynomial-time algorithm to find a linkless embedding of a graph (English)
0 references
4 March 2009
0 references
linkless embedding
0 references
3-space
0 references
graphs
0 references
algorithm
0 references
polynomial-time
0 references
