We investigate the computational complexity of the following problem. Given a planar graph in which some vertices have already been placed in the plane, place the remaining vertices to form a planar straight-line drawing of the whole graph. We show that this extensibility problem, proposed in the 2003 Selected Open Problems in Graph Drawing [1], is NP-hard. -
Patrignani, M. (2006). On Extending a Partial Straight-Line Drawing. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 17, 1061-1069 [10.1142/S0129054106004261].
On Extending a Partial Straight-Line Drawing
PATRIGNANI, Maurizio
2006-01-01
Abstract
We investigate the computational complexity of the following problem. Given a planar graph in which some vertices have already been placed in the plane, place the remaining vertices to form a planar straight-line drawing of the whole graph. We show that this extensibility problem, proposed in the 2003 Selected Open Problems in Graph Drawing [1], is NP-hard. -File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
