10 results on '"Liotta, Giuseppe"'
Search Results
2. On the Planar Split Thickness of Graphs.
- Author
-
Eppstein, David, Kindermann, Philipp, Kobourov, Stephen, Liotta, Giuseppe, Lubiw, Anna, Maignan, Aude, Mondal, Debajyoti, Vosoughpour, Hamideh, Whitesides, Sue, and Wismath, Stephen
- Subjects
BIPARTITE graphs ,GEOMETRIC vertices ,APPROXIMATION theory ,COMPLETE graphs ,VISUALIZATION - Abstract
Motivated by applications in graph drawing and information visualization, we examine the planar split thickness of a graph, that is, the smallest
k such that the graph isk -splittable into a planar graph. Ak -split operation substitutes a vertexv by at mostk new vertices such that each neighbor ofv is connected to at least one of the new vertices. We first examine the planar split thickness of complete graphs, complete bipartite graphs, multipartite graphs, bounded degree graphs, and genus-1 graphs. We then prove that it is NP-hard to recognize graphs that are 2-splittable into a planar graph, and show that one can approximate the planar split thickness of a graph within a constant factor. If the treewidth is bounded, then we can even verifyk -splittability in linear time, for a constantk . [ABSTRACT FROM AUTHOR]- Published
- 2018
- Full Text
- View/download PDF
3. On partitioning the edges of 1-plane graphs.
- Author
-
Lenhart, William J., Liotta, Giuseppe, and Montecchiani, Fabrizio
- Subjects
- *
GRAPHIC methods , *GEOMETRIC vertices , *GEOMETRICAL drawing , *ANGLES , *COLORS - Abstract
A 1-plane graph is a graph embedded in the plane such that each edge is crossed at most once. A 1-plane graph is optimal if it has maximum edge density. A red–blue edge coloring of an optimal 1-plane graph G partitions the edge set of G into blue edges and red edges such that no two blue edges cross each other and no two red edges cross each other. We prove the following: ( i ) Every optimal 1-plane graph has a red–blue edge coloring such that the blue subgraph is maximal planar while the red subgraph has vertex degree at most four; this bound on the vertex degree is worst-case optimal. ( ii ) A red–blue edge coloring may not always induce a red forest of bounded vertex degree. Applications of these results to graph augmentation and graph drawing are also discussed. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
4. Area-Thickness Trade-Offs for Straight-Line Drawings of Planar Graphs.
- Author
-
DI GIACOMO, EMILIO, DIDIMO, WALTER, LIOTTA, GIUSEPPE, and MONTECCHIANI, FABRIZIO
- Subjects
PLANAR graphs ,DRAWING ,GEOMETRIC vertices ,EDGES (Geometry) ,MATHEMATICAL mappings - Abstract
We study the problem of computing drawings of planar graphs in sub-quadratic area, by allowing edge crossings. We first prove that sub-quadratic area cannot be achieved if only a constant number of crossings per edge is allowed. More precisely, we show that the same area lower bounds as in the crossing-free case hold for straight-line and poly-line drawings of planar graphs and seriesparallel graphs. Motivated by this result, we study straight-line drawings of planar graphs where the number of crossings per edge is not bounded by a constant. In this case, we prove that every planar graph admits a straight-line drawing with sub-quadratic area and sub-linear thickness (the thickness of a drawing is the minimum number of colors that can be assigned to the edges so that each color class induces a planar drawing). We also prove that every partial 2-tree (and hence every series-parallel graph) admits a linear-area straight-line drawing with thickness at most 10. It is worth remarking that a drawing with thickness h - 1 is h-quasi planar, i.e. it does not contain h-mutually crossing edges. The main ingredient to prove our results is (c, t)-track layouts, a combinatorial tool that can be represented as a drawing where: (i) each vertex is assigned to one of t horizontal layers (tracks), (ii) no two adjacent vertices are on the same track, (iii) each edge receives one of c colors, so that no two edges of the same color (u, v) and (w, z) cross if u, w are on the same track, and v, z are on the same track. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
5. Lower and upper bounds for long induced paths in 3-connected planar graphs.
- Author
-
Di Giacomo, Emilio, Liotta, Giuseppe, and Mchedlidze, Tamara
- Subjects
- *
MATHEMATICAL bounds , *PLANAR graphs , *PATHS & cycles in graph theory , *GEOMETRIC vertices , *MATHEMATICAL inequalities , *SUBGRAPHS - Abstract
Let G be a 3-connected planar graph with n vertices and let p ( G ) be the maximum number of vertices of an induced subgraph of G that is a path. Substantially improving previous results, we prove that p ( G ) ≥ log n 12 log log n . To demonstrate the tightness of this bound, we notice that the above inequality implies p ( G ) ∈ Ω ( ( log 2 n ) 1 − ε ) , where ε is any positive constant smaller than 1, and describe an infinite family of planar graphs for which p ( G ) ∈ O ( log n ) . As a byproduct of our research, we prove a result of independent interest: Every 3-connected planar graph with n vertices contains an induced subgraph that is outerplanar and connected and that contains at least n 3 vertices. The proofs in the paper are constructive and give rise to O ( n ) -time algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
6. Planar and Quasi-Planar Simultaneous Geometric Embedding.
- Author
-
DI GIACOMO, EMILIO, DIDIMO, WALTER, LIOTTA, GIUSEPPE, MEIJER, HENK, and WISMATH, STEPHEN K.
- Subjects
GEOMETRIC vertices ,PLANAR graphs ,EMBEDDINGS (Mathematics) ,MONOTONE operators ,COORDINATES - Abstract
A simultaneous geometric embedding (SGE) of two planar graphs G
1 and G2 with the same vertex set is a pair of straight-line planar drawings Γ1 of G1 and Γ2 of G2 such that each vertex is drawn at the same point in Γ1 Γ2 . Many papers have been devoted to the study of which pairs of graphs admit a SGE, and both positive and negative results have been proved. We extend the study of SGE, by introducing and characterizing a new class of planar graphs that makes it possible to immediately extend several positive results that rely on the property of strictly monotone paths. Moreover, we introduce a relaxation of the SGE setting where Γ1 and Γ2 are required to be quasi-planar (i.e. they can have crossings provided that there are no three mutually crossing edges). This relaxation allows for the simultaneous embedding of pairs of planar graphs that are not simultaneously embeddable in the classical SGE setting and opens up several new interesting research questions. [ABSTRACT FROM AUTHOR]- Published
- 2015
- Full Text
- View/download PDF
7. Polyline drawings with topological constraints.
- Author
-
Di Giacomo, Emilio, Eades, Peter, Liotta, Giuseppe, Meijer, Henk, and Montecchiani, Fabrizio
- Subjects
- *
TOPOLOGY , *DRAWING , *EDGES (Geometry) , *CURVES , *GEOMETRIC vertices - Abstract
We study the problem of representing topological graphs as polyline drawings with few bends per edge and such that the topology of the graph is either fully or partially preserved. More formally, let G be a simple topological graph and let Γ be a polyline drawing of G. Drawing Γ partially preserves the topology of G if it has the same external boundary, the same circular order of the edges around each vertex, and the same set of crossings as G , while it fully preserves the topology of G if the planarization of G and the planarization of Γ have the same planar embedding. We prove that if the set of crossing-free edges of G forms a biconnected (connected) spanning subgraph, then G admits a polyline drawing that partially preserves its topology and that has curve complexity at most one (three), i.e., with at most one (three) bend(s) per edge. If, however, the set of crossing-free edges of G is not a connected spanning subgraph, the curve complexity may be Ω (n) , while it is O (1) if the number of connected components is O (1). Concerning drawings that fully preserve the topology, we show that if G is k -skew (i.e., it becomes planar after removing k suitably chosen edges), it admits one such drawing with curve complexity at most 2 k ; for 1-skew graphs, the curve complexity can be reduced to one, which is a tight bound. We also consider optimal 2-plane graphs (i.e., with at most two crossings per edge and maximum edge density), for which we discuss trade-offs between curve complexity and crossing angle resolution of drawings that fully preserve the topology. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
8. Edge partitions of optimal 2-plane and 3-plane graphs.
- Author
-
Bekos, Michael A., Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Montecchiani, Fabrizio, and Raftopoulou, Chrysanthi
- Subjects
- *
TOPOLOGICAL graph theory , *EDGES (Geometry) , *SET theory , *PROBLEM solving , *GEOMETRIC vertices - Abstract
Abstract A topological graph is a graph drawn in the plane. A topological graph is k -plane, k > 0 , if each edge is crossed at most k times. We study the problem of partitioning the edges of a k -plane graph such that each partite set forms a graph with a simpler structure. While this problem has been studied for k = 1 , we focus on optimal 2-plane and on optimal 3-plane graphs, which are 2-plane and 3-plane graphs with maximum density. We prove the following results. (i) It is not possible to partition the edges of a simple (i.e., with neither self-loops nor parallel edges) optimal 2-plane graph into a 1-plane graph and a forest, while (ii) an edge partition formed by a 1-plane graph and two plane forests always exists and can be computed in linear time. (iii) There exist efficient algorithms to partition the edges of a simple optimal 2-plane graph into a 1-plane graph and a plane graph with maximum vertex degree at most 12, or with maximum vertex degree at most 8 if the optimal2-plane graph is such that its crossing-free edges form a graph with no separating triangles. (iv) There exists an infinite family of simple optimal 2-plane graphs such that in any edge partition composed of a 1-plane graph and a plane graph, the plane graph has maximum vertex degree at least 6 and the 1-plane graph has maximum vertex degree at least 12. (v) Every optimal 3-plane graph whose crossing-free edges form a biconnected graph can be decomposed, in linear time, into a 2-plane graph and two plane forests. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
9. New results on edge partitions of 1-plane graphs.
- Author
-
Di Giacomo, Emilio, Didimo, Walter, Evans, William S., Liotta, Giuseppe, Meijer, Henk, Montecchiani, Fabrizio, and Wismath, Stephen K.
- Subjects
- *
GRAPHIC methods , *GEOMETRIC vertices , *EDGES (Geometry) , *GRAPH algorithms , *BIPARTITE graphs - Abstract
A 1 -plane graph is a graph embedded in the plane such that each edge is crossed at most once. A NIC-plane graph is a 1-plane graph such that any two pairs of crossing edges share at most one end-vertex. An edge partition of a 1-plane graph G is a coloring of the edges of G with two colors, red and blue, such that both the graph induced by the red edges and the graph induced by the blue edges are plane graphs. We prove the following: ( i ) Every NIC-plane graph admits an edge partition such that the red graph has maximum vertex degree three; this bound on the vertex degree is worst-case optimal. ( ii ) Deciding whether a NIC-plane graph admits an edge partition such that the red graph has maximum vertex degree two is NP-complete. ( iii ) Deciding whether a 1-plane graph admits an edge partition such that the red graph has maximum vertex degree one, and computing one in the positive case, can be done in quadratic time. Applications of these results to graph drawing are also discussed. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
10. Colored anchored visibility representations in 2D and 3D space.
- Author
-
Binucci, Carla, Di Giacomo, Emilio, Hong, Seok-Hee, Liotta, Giuseppe, Meijer, Henk, Sacristán, Vera, and Wismath, Stephen
- Subjects
- *
VISIBILITY , *REPRESENTATIONS of graphs , *GEOMETRIC vertices , *SPACE - Abstract
In a visibility representation of a graph G , the vertices are represented by non-overlapping geometric objects, while the edges are represented as segments that only intersect the geometric objects associated with their end-vertices. Given a set P of n points, an Anchored Visibility Representation of a graph G with n vertices is a visibility representation such that for each vertex v of G , the geometric object representing v contains a point of P. We prove positive and negative results about the existence of anchored visibility representations under various models, both in 2D and in 3D space. We consider the case when the mapping between the vertices and the points is not given and the case when it is only partially given. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.