n this paper we study the problem of computing homothetic triangle contact representations of planar graphs. Since not all planar graphs admit such a representation, we concentrate on meaningful subfamilies of planar graphs and prove that: (i) every two-terminal series-parallel digraph has a homothetic triangle contact representation, which can be computed in linear time; (ii) every partial planar 3-tree admits a homothetic triangle contact representation. -

Melanie, B., Carla, B., EMILIO DI, G., Walter, D., Stefan, F., Francesco, G., et al. (2007). Homothetic Triangle Contact Representations of Planar Graphs. In 19th Annual Canadian Conference on Computational Geometry (CCCG'07) (pp. 233-236). Ottawa : Carleton University.

Homothetic Triangle Contact Representations of Planar Graphs

PATRIGNANI, Maurizio;
2007-01-01

Abstract

n this paper we study the problem of computing homothetic triangle contact representations of planar graphs. Since not all planar graphs admit such a representation, we concentrate on meaningful subfamilies of planar graphs and prove that: (i) every two-terminal series-parallel digraph has a homothetic triangle contact representation, which can be computed in linear time; (ii) every partial planar 3-tree admits a homothetic triangle contact representation. -
2007
978-0-7709-0520-0
Melanie, B., Carla, B., EMILIO DI, G., Walter, D., Stefan, F., Francesco, G., et al. (2007). Homothetic Triangle Contact Representations of Planar Graphs. In 19th Annual Canadian Conference on Computational Geometry (CCCG'07) (pp. 233-236). Ottawa : Carleton University.
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/171447
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 11
  • ???jsp.display-item.citation.isi??? ND
social impact