Embedding a triangular graph within a given boundary (Q654561)
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: Embedding a triangular graph within a given boundary |
scientific article; zbMATH DE number 5992817
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Embedding a triangular graph within a given boundary |
scientific article; zbMATH DE number 5992817 |
Statements
Embedding a triangular graph within a given boundary (English)
0 references
29 December 2011
0 references
Given a 3-vertex-connected triangular planar graph and an embedding of its boundary vertices, can the interior vertices be embedded to form a valid triangulation? An algorithm which decides this problem and produces such an embedding if it exists, or reject the input in case no valid embedding exists is described in this article. Experimental results demonstrate the effectiveness of the introduced algorithm.
0 references
triangulation
0 references
embedding
0 references
planar graph
0 references
algorithm
0 references
0.7786352634429932
0 references
0.7786352634429932
0 references
0.7719927430152893
0 references
0.7508103251457214
0 references
