• Aiuto
  • Sfoglia

    • We study the problem of drawing simultaneously embedded graphs with few bends. We show that for any simultaneous embedding with fixed edges (Sefe) of two graphs, there exists a corresponding drawing realizing this embedding such that common edges are drawn as straight-line segments and each exclusive edge has a constant number of bends. If the common graph is biconnected and induced, a straight-line drawing exists. This yields the first efficient testing algorithm for simultaneous geometric embedding (Sge) for a non-trivial class of graphs.


    Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11391/1326706

    Titolo: Drawing Simultaneously Embedded Graphs with Few Bends
    Autori interni: GRILLI, LUCA
    Data di pubblicazione: 2014
    Serie: LECTURE NOTES IN COMPUTER SCIENCE  
    Abstract: We study the problem of drawing simultaneously embedded graphs with few bends. We show that for any simultaneous embedding with fixed edges (Sefe) of two graphs, there exists a corresponding drawing realizing this embedding such that common edges are drawn as straight-line segments and each exclusive edge has a constant number of bends. If the common graph is biconnected and induced, a straight-line drawing exists. This yields the first efficient testing algorithm for simultaneous geometric embedding (Sge) for a non-trivial class of graphs.
    Handle: http://hdl.handle.net/11391/1326706
    ISBN: 9783662458020
    9783662458037
    Appare nelle tipologie:4.1 Contributo in Atti di convegno

    File in questo prodotto:
    Non ci sono file associati a questo prodotto.
    • Citazioni
    • ND

    I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
     
     
     
    Powered by IRIS-about IRIS-Utilizzo dei cookie
    Logo CINECA  Copyright © 2017