Akademska digitalna zbirka SLovenije - logo
VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Geometric simultaneous embeddings of a graph and a matching [Elektronski vir]
    Cabello, Sergio ...
    The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is plane. Geometric ... simultaneous embedding is a current topic in graph drawing and positive and neg- ative results are known for various classes of graphs. So far only connected graphs have been considered. In this paper we present the first results for the setting where one of the graphs is a matching. In particular, we show that there exists a planar graph and a matching which do not admit a geometric simultaneous embedding. This generalizes the same result for a planar graph and a path. On the positive side, we describe algorithms that compute a geometric simultaneous embedding of a matching and a wheel, outerpath, or tree. Our drawing algorithms minimize the number of orientations used to draw the edges of the matching. Specifically, when embedding a matching and a tree, we can draw all matching edges horizontally. When embedding a matching and a wheel or an outerpath, we use only two orientations.
    Vir: Preprint series. - ISSN 1318-4865 (Vol. 47, št. 1106, 2009, str. 1-13)
    Vrsta gradiva - e-članek
    Leto - 2009
    Jezik - angleški
    COBISS.SI-ID - 15332953

    Povezava(-e):

    http://www.imfm.si/preprinti/PDF/01106.pdf

Vnos na polico