A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Testing Planarity of Partially Embedded Graphs
[chapter]

2010
*
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms
*

We study the following problem: Given a planar graph G and a planar drawing (embedding) of a subgraph of G, can such a drawing be extended to a planar drawing of the entire graph G? This problem fits the paradigm of extending a partial solution to a complete one, which has been studied before in many different settings. Unlike many cases, in which the presence of a partial solution in the input makes hard an otherwise easy problem, we show that the planarity question remains polynomial-time

doi:10.1137/1.9781611973075.19
dblp:conf/soda/AngeliniBFJKPR10
fatcat:2sufcifdqreq7m3dqehjxjsdaq