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-complete. -

Patrignani, M. (2005). On Extending a Partial Straight-Line Drawing. In Graph Drawing, GD 2005, Lecture Notes in Computer Science 3843 (pp. 380-385). Berling Heidelberg : Springer-Verlag [10.1007/11618058_34].

On Extending a Partial Straight-Line Drawing

PATRIGNANI, Maurizio
2005-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-complete. -
2005
3-540-31425-3
Patrignani, M. (2005). On Extending a Partial Straight-Line Drawing. In Graph Drawing, GD 2005, Lecture Notes in Computer Science 3843 (pp. 380-385). Berling Heidelberg : Springer-Verlag [10.1007/11618058_34].
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11590/171446
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 9
  • ???jsp.display-item.citation.isi??? ND
social impact