29 results on '"LIOTTA, GIUSEPPE"'
Search Results
2. k-Planar Placement and Packing of Δ-Regular Caterpillars.
- Author
-
Binucci, Carla, Di Giacomo, Emilio, Kaufmann, Michael, Liotta, Giuseppe, and Tappini, Alessandra
- Subjects
CATERPILLARS ,PLANAR graphs - Abstract
This paper studies a packing problem in the so-called beyond-planar setting, that is when the host graph is "almost-planar" in some sense. Precisely, we consider the case that the host graph is k -planar, i.e., it admits an embedding with at most k crossings per edge, and focus on families of Δ -regular caterpillars, that are caterpillars whose non-leaf vertices have the same degree Δ. We study the dependency of k from the number h of caterpillars that are packed, both in the case that these caterpillars are all isomorphic to one another (in which case the packing is called placement) and when they are not. We give necessary and sufficient conditions for the placement of h Δ -regular caterpillars and sufficient conditions for the packing of a set of Δ 1 -, Δ 2 -, ... , Δ h -regular caterpillars such that the degree Δ i and the degree Δ j of the non-leaf vertices can differ from one caterpillar to another, for 1 ≤ i , j ≤ h , i ≠ j. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
3. The Partial Visibility Representation Extension Problem
- Author
-
Chaplick, Steven, Guśpiel, Grzegorz, Gutowski, Grzegorz, Krawczyk, Tomasz, and Liotta, Giuseppe
- Published
- 2018
- Full Text
- View/download PDF
4. Computing Bend-Minimum Orthogonal Drawings of Plane Series–Parallel Graphs in Linear Time.
- Author
-
Didimo, Walter, Kaufmann, Michael, Liotta, Giuseppe, and Ortali, Giacomo
- Subjects
PLANAR graphs ,OPEN-ended questions - Abstract
A planar orthogonal drawing of a planar 4-graph G (i.e., a planar graph with vertex-degree at most four) is a crossing-free drawing that maps each vertex of G to a distinct point of the plane and each edge of G to a polygonal chain consisting of horizontal and vertical segments. A longstanding open question in Graph Drawing, dating back over 30 years, is whether there exists a linear-time algorithm to compute an orthogonal drawing of a plane 4-graph with the minimum number of bends. The term "plane" indicates that the input graph comes together with a planar embedding, which must be preserved by the drawing (i.e., the drawing must have the same set of faces as the input graph). In this paper we positively answer the question above for the widely-studied class of series–parallel graphs. Our linear-time algorithm is based on a characterization of the planar series–parallel graphs that admit an orthogonal drawing without bends. This characterization is given in terms of the orthogonal spirality that each type of triconnected component of the graph can take; the orthogonal spirality of a component measures how much that component is "rolled-up" in an orthogonal drawing of the graph. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
5. Parameterized complexity of graph planarity with restricted cyclic orders.
- Author
-
Liotta, Giuseppe, Rutter, Ignaz, and Tappini, Alessandra
- Subjects
- *
REPRESENTATIONS of graphs , *PLANAR graphs , *GRAPH algorithms - Abstract
We study the complexity of testing whether a biconnected graph G = (V , E) is planar with the constraint that some cyclic orders of the edges incident to its vertices are allowed while some others are forbidden. The allowed cyclic orders are described by associating every vertex v of G with a set D (v) of FPQ-trees. Let tw be the treewidth of G and let D max be the maximum number of FPQ-trees per vertex. We show that the problem is FPT when parameterized by tw + D max , paraNP-hard when parameterized by D max , and W[1]-hard when parameterized by tw. We also consider NodeTrix planar representations of clustered graphs, where clusters are adjacency matrices and inter-cluster edges are non-intersecting simple curves. We prove that NodeTrix planarity with fixed sides is FPT when parameterized by the size of clusters plus the treewidth of the graph obtained by collapsing clusters to single vertices, provided that this graph is biconnected. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
6. Drawing Partial 2-Trees with Few Slopes.
- Author
-
Lenhart, William, Liotta, Giuseppe, Mondal, Debajyoti, and Nishat, Rahnuma Islam
- Subjects
- *
PLANAR graphs , *INTEGERS - Abstract
The planar slope number of a planar graph G is the minimum integer k such that G admits a planar drawing with vertices as points and edges as straight-line segments with k distinct slopes. Similarly, a plane slope number is defined for a plane graph, where a fixed combinatorial embedding of the graph is given and the output must respect the given embedding. We prove tight bounds (up to a small multiplicative or additive constant) for the plane and the planar slope numbers of partial 2-trees of bounded degree. We also answer a long standing question by Garg and Tamassia (In: van Leeuwen J (eds) Proceedings of the Second Annual European Symposium on Algorithms (ESA), LNCS, vol 855, pp 12–23, Springer, 1994) on the angular resolution of the planar straight-line drawings of series-parallel graphs of bounded degree. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
7. Universal Slope Sets for Upward Planar Drawings.
- Author
-
Bekos, Michael A., Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, and Montecchiani, Fabrizio
- Subjects
PLANAR graphs ,CHARTS, diagrams, etc. - Abstract
We study universal sets of slopes for computing upward planar drawings of planar st-graphs. We first consider a subfamily of planar st-graphs, called bitonic st-graphs. We prove that every set S of Δ slopes containing the horizontal slope is universal for 1-bend upward planar drawings of bitonic st-graphs with maximum vertex degree Δ , i.e., every such digraph admits a 1-bend upward planar drawing whose edge segments use only slopes in S . This result is worst-case optimal in terms of number of slopes, and, for a suitable choice of S , it gives rise to drawings with worst-case optimal angular resolution. We then prove that every such set S can be used to construct 2-bend upward planar drawings of n-vertex planar st-graphs with at most 4 n - 9 bends in total. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
8. On Edge-Length Ratios of Partial 2-Trees.
- Author
-
Blažj, Václav, Fiala, Jiří, and Liotta, Giuseppe
- Subjects
PLANAR graphs ,LOGICAL prediction ,EDGES (Geometry) - Abstract
The edge-length ratio of a planar straight-line drawing of a graph is the maximum ratio between the lengths of any two of its edges. When the edges to be considered in the ratio are required to be adjacent, the ratio is called local edge-length ratio. The (local) edge-length ratio of a graph G is the infimum over all (local) edge-length ratios in the planar straight-line drawings of G. We prove that the edge-length ratio of the n -vertex 2-trees is Ω (log n) , which proves a conjecture by Lazard et al. [TCS 770, 2019, pp. 88–94] and complements an upper bound by Borrazzo and Frati [JoCG 11(1), 2020, pp. 137–155]. We also prove that every partial 2-tree admits a planar straight-line drawing whose local edge-length ratio is at most 4 + for any arbitrarily small > 0. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
9. A universal slope set for 1-bend planar drawings
- Author
-
Angelini, Patrizio, Bekos, Michael A., Liotta, Giuseppe, and Montecchiani, Fabrizio
- Subjects
060201 languages & linguistics ,Slope number ,000 Computer science, knowledge, general works ,Planar graphs ,06 humanities and the arts ,02 engineering and technology ,1-bend drawings ,Angular resolution ,Software ,0602 languages and literature ,Computer Science ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing - Abstract
We describe a set of Delta-1 slopes that are universal for 1-bend planar drawings of planar graphs of maximum degree Delta>=4; this establishes a new upper bound of Delta-1 on the 1-bend planar slope number. By universal we mean that every planar graph of degree Delta has a planar drawing with at most one bend per edge and such that the slopes of the segments forming the edges belong to the given set of slopes. This improves over previous results in two ways: Firstly, the best previously known upper bound for the 1-bend planar slope number was 3/2(Delta-1) (the known lower bound being 3/4(Delta-1)); secondly, all the known algorithms to construct 1-bend planar drawings with O(Delta) slopes use a different set of slopes for each graph and can have bad angular resolution, while our algorithm uses a universal set of slopes, which also guarantees that the minimum angle between any two edges incident to a vertex is pi/(Delta-1).
- Published
- 2017
10. A Survey on Graph Drawing Beyond Planarity.
- Author
-
DIDIMO, WALTER, LIOTTA, GIUSEPPE, and MONTECCHIANI, FABRIZIO
- Subjects
- *
REPRESENTATIONS of graphs , *PLANAR graphs , *GRAPH algorithms , *GRAPH theory - Abstract
Graph Drawing Beyond Planarity is a rapidly growing research area that classifies and studies geometric representations of nonplanar graphs in terms of forbidden crossing configurations. The aim of this survey is to describe the main research directions in this area, the most prominent known results, and some of the most challenging open problems. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
11. The Partial Visibility Representation Extension Problem
- Author
-
Chaplick, Steven, Guspiel, Grzegorz, Gutowski, Grzegorz, Krawczyk, Tomasz, Liotta, Giuseppe, Hu, Y., and Nöllenburg, M.
- Subjects
Computational Geometry (cs.CG) ,FOS: Computer and information sciences ,Vertex (graph theory) ,SPQR-trees ,General Computer Science ,0102 computer and information sciences ,02 engineering and technology ,St-ordering ,01 natural sciences ,bar visibility ,Combinatorics ,symbols.namesake ,Partial representation extension ,020204 information systems ,Bar visibility ,NP-completeness ,Planar graphs ,Computer Science (all) ,Computer Science Applications1707 Computer Vision and Pattern Recognition ,Applied Mathematics ,0202 electrical engineering, electronic engineering, information engineering ,Undirected graph ,Physics ,Horizontal line segment ,I.3.5 ,Directed graph ,planar graphs ,68U05 ,Graph ,Computer Science Applications ,Upward planar drawing ,Planar graph ,010201 computation theory & mathematics ,symbols ,Computer Science - Computational Geometry ,High Energy Physics::Experiment ,partial representation extension - Abstract
For a graph $G$, a function $\psi$ is called a \emph{bar visibility representation} of $G$ when for each vertex $v \in V(G)$, $\psi(v)$ is a horizontal line segment (\emph{bar}) and $uv \in E(G)$ iff there is an unobstructed, vertical, $\varepsilon$-wide line of sight between $\psi(u)$ and $\psi(v)$. Graphs admitting such representations are well understood (via simple characterizations) and recognizable in linear time. For a directed graph $G$, a bar visibility representation $\psi$ of $G$, additionally, puts the bar $\psi(u)$ strictly below the bar $\psi(v)$ for each directed edge $(u,v)$ of $G$. We study a generalization of the recognition problem where a function $\psi'$ defined on a subset $V'$ of $V(G)$ is given and the question is whether there is a bar visibility representation $\psi$ of $G$ with $\psi(v) = \psi'(v)$ for every $v \in V'$. We show that for undirected graphs this problem together with closely related problems are \NP-complete, but for certain cases involving directed graphs it is solvable in polynomial time., Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016)
- Published
- 2016
12. Universal Slope Sets for 1-Bend Planar Drawings.
- Author
-
Angelini, Patrizio, Bekos, Michael A., Liotta, Giuseppe, and Montecchiani, Fabrizio
- Subjects
PLANAR graphs ,DRAWING - Abstract
We prove that every set of Δ - 1 slopes is 1-bend universal for the planar graphs with maximum vertex degree Δ . This means that any planar graph with maximum degree Δ admits a planar drawing with at most one bend per edge and such that the slopes of the segments forming the edges can be chosen in any given set of Δ - 1 slopes. Our result improves over previous literature in three ways: Firstly, it improves the known upper bound of 3 2 (Δ - 1) on the 1-bend planar slope number; secondly, the previously known algorithms compute 1-bend planar drawings by using sets of O (Δ) slopes that may vary depending on the input graph; thirdly, while these algorithms typically minimize the slopes at the expenses of constructing drawings with poor angular resolution, we can compute drawings whose angular resolution is at least π Δ - 1 , which is worst-case optimal up to a factor of 3 4 . Our proofs are constructive and give rise to a linear-time drawing algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
13. HV-planarity: Algorithms and complexity.
- Author
-
Didimo, Walter, Liotta, Giuseppe, and Patrignani, Maurizio
- Subjects
- *
COMPUTATIONAL complexity , *PLANAR graphs , *PROBLEM solving , *APPROXIMATION algorithms , *COMPUTER algorithms - Abstract
Abstract An HV-graph is a planar graph with vertex-degree at most four such that each edge is labeled either H (horizontal) or V (vertical). The HV-planarity testing problem asks whether an HV-graph admits an HV-drawing , that is, a planar drawing such that each edge with label H is drawn as a horizontal segment and each edge with label V is drawn as a vertical segment. We prove that the HV-planarity testing problem is NP-complete even for graphs with vertex-degree at most three, which answers an open question posed by both Manuch et al. [30] and Durocher et al. [17]. On the positive side, we prove that the HV-planarity testing problem can be solved in polynomial-time for series-parallel graphs. This result significantly extends a previous result by Durocher et al. about HV-planarity testing of biconnected outerplanar graphs of maximum vertex-degree three. Highlights • HV-planarity testing is NP-complete, even for graphs with vertex-degree at most 3. • Polynomial-time HV-planarity testing for 2-connected series-parallel graphs. • Polynomial-time HV-planarity testing for partial 2-trees. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
14. Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs.
- Author
-
Biedl, Therese, Liotta, Giuseppe, and Montecchiani, Fabrizio
- Subjects
- *
PLANAR graphs , *EMBEDDINGS (Mathematics) , *RECTANGLES , *EDGES (Geometry) , *POLYNOMIAL time algorithms - Abstract
A (weak) rectangle visibility representation, or simply an RVR, of a graph consists of an assignment of axis-aligned rectangles to vertices such that for every edge there exists a horizontal or vertical line of sight between the rectangles assigned to its endpoints. Given a graph with a fixed embedding in the plane, we show that the problem of testing whether this graph has an embedding-preserving RVR can be solved in polynomial time for general embedded graphs and in linear time for 1-plane graphs, i.e., for embedded graphs having at most one crossing per edge. The linear time algorithm uses three forbidden configurations, which extend the set known for straight-line drawings of 1-plane graphs. The algorithm first checks for the presence of these forbidden configurations in the input graph, and then either an embedding-preserving RVR is computed (also in linear time) or a forbidden configuration is reported as a negative witness. Finally, we discuss extensions of our study to the case when the embedding is not fixed but the RVR can have at most one crossing per edge. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
15. Drawing subcubic planar graphs with four slopes and optimal angular resolution.
- Author
-
Di Giacomo, Emilio, Liotta, Giuseppe, and Montecchiani, Fabrizio
- Subjects
- *
GEOMETRIC vertices , *PLANAR graphs , *SLOPES (Physical geography) , *THREE-dimensional display systems , *GEOMETRIC modeling - Abstract
A subcubic planar graph is a planar graph whose vertices have degree at most 3. We show that the subcubic planar graphs with at least five vertices have planar slope number at most 4, which is worst-case optimal. This answers an open question by Jelínek et al. [10] . Furthermore, we prove that the subcubic planar graphs with at least five vertices have angular resolution π / 4 , which solves an open problem by Kant [11] and by Formann et al. [8] . [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
16. An annotated bibliography on 1-planarity.
- Author
-
Kobourov, Stephen G., Liotta, Giuseppe, and Montecchiani, Fabrizio
- Subjects
PLANAR graphs ,GRAPH theory ,GRAPHIC methods ,GRAPH algorithms ,ANNOTATIONS - Abstract
The notion of 1-planarity is among the most natural and most studied generalizations of graph planarity. A graph is 1-planar if it has an embedding where each edge is crossed by at most another edge. The study of 1-planar graphs dates back to more than fifty years ago and, recently, it has driven increasing attention in the areas of graph theory, graph algorithms, graph drawing, and computational geometry. This annotated bibliography aims to provide a guiding reference to researchers who want to have an overview of the large body of literature about 1-planar graphs. It reviews the current literature covering various research streams about 1-planarity, such as characterization and recognition, combinatorial properties, and geometric representations. As an additional contribution, we offer a list of open problems on 1-planar graphs. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
17. 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
18. 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
19. 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
20. A Linear-Time Algorithm for Testing Outer-1-Planarity.
- Author
-
Hong, Seok-Hee, Eades, Peter, Katoh, Naoki, Liotta, Giuseppe, Schweitzer, Pascal, and Suzuki, Yusuke
- Subjects
LINEAR time invariant systems ,PLANAR graphs ,ALGORITHMS ,PLANE geometry ,EMBEDDING theorems - Abstract
A graph is 1-planar if it can be embedded in the plane with at most one crossing per edge. It is known that the problem of testing 1-planarity of a graph is NP-complete. In this paper, we study outer-1-planar graphs. A graph is outer-1-planar if it has an embedding in which every vertex is on the outer face and each edge has at most one crossing. We present a linear time algorithm to test whether a given graph is outer-1-planar. The algorithm can be used to produce an outer-1-planar embedding in linear time if it exists. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
21. The Approximate Rectangle of Influence Drawability Problem.
- Author
-
Di Giacomo, Emilio, Liotta, Giuseppe, and Meijer, Henk
- Subjects
- *
APPROXIMATION theory , *PROBLEM solving , *NEGATIVE numbers , *GRAPH theory , *FACTOR analysis , *PLANAR graphs - Abstract
Let ε, ε be two non negative numbers. An approximate rectangle of influence drawing (also called ( ε, ε)-RID) is a proximity drawing of a graph such that: (i) if u, v are adjacent vertices then their rectangle of influence 'scaled down' by the factor $\frac{1}{1+\varepsilon_{1}}$ does not contain other vertices of the drawing; (ii) if u, v are not adjacent, then their rectangle of influence 'blown-up' by the factor 1+ ε contains some vertices of the drawing other than u and v. Firstly, we prove that all planar graphs have an ( ε, ε)-RID for any ε>0 and ε>0, while there exist planar graphs which do not admit an ( ε,0)-RID and planar graphs which do not admit a (0, ε)-RID. Then, we investigate (0, ε)-RIDs; we prove that both the outerplanar graphs and a suitably defined family of graphs without separating 3-cycles admit this type of drawing. Finally, we study polynomial area approximate rectangle of influence drawings and prove that (0, ε)-RIDs of proper track planar graphs (a superclass of the outerplanar graphs) can be computed in polynomial area for any ε>2. As for values of ε such that ε≤2, we describe a drawing algorithm that computes (0, ε)-RIDs of binary trees in area $O(n^{c + f(\varepsilon_{2})})$, where c is a positive constant, f( ε) is a poly-logarithmic function that tends to infinity as ε tends to zero, and n is the number of vertices of the input tree. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
22. Graph Planarity by Replacing Cliques with Paths †.
- Author
-
Angelini, Patrizio, Eades, Peter, Hong, Seok-Hee, Klein, Karsten, Kobourov, Stephen, Liotta, Giuseppe, Navarra, Alfredo, and Tappini, Alessandra
- Subjects
PLANAR graphs ,POLYNOMIAL time algorithms - Abstract
This paper introduces and studies the following beyond-planarity problem, which we call h-Clique2Path Planarity. Let G be a simple topological graph whose vertices are partitioned into subsets of size at most h, each inducing a clique. h-Clique2Path Planarity asks whether it is possible to obtain a planar subgraph of G by removing edges from each clique so that the subgraph induced by each subset is a path. We investigate the complexity of this problem in relation to k-planarity. In particular, we prove that h-Clique2Path Planarity is NP-complete even when h = 4 and G is a simple 3-plane graph, while it can be solved in linear time when G is a simple 1-plane graph, for any value of h. Our results contribute to the growing fields of hybrid planarity and of graph drawing beyond planarity. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
23. 2-colored point-set embeddings of partial 2-trees.
- Author
-
Di Giacomo, Emilio, Hančl, Jaroslav, and Liotta, Giuseppe
- Subjects
- *
PLANAR graphs , *POINT set theory , *CATERPILLARS - Abstract
• For n ≥ 14 there is a properly 2-colored SP-graph with 2 n + 4 vertices s.t. any 2-colored PSE requires Ω (n) bends on Ω (n) edges • 2 bends per edge suffice for a 2-colored PSE of properly 2-colored outerplanar graphs • 1 bend per edge suffices for a 2-colored PSE of a properly 2-colored outerplanar graph if the points are linearly separable • 3 bends per edge suffice for a 2-colored PSE of a 2-colored outerplanar graph • 1 bend per edge suffices for a 2-colored PSE of a 2-colored caterpillar Let G be a planar graph whose vertices are colored either red or blue and let S be a set of points having as many red (resp. blue) points as the red (resp. blue) vertices of G. A 2-colored point-set embedding of G on S is a planar drawing that maps each red (resp. blue) vertex of G to a red (resp. blue) point of S. We show that there exist partial 2-trees that are properly 2-colored (i.e., they are 2-colored with no two adjacent vertices have the same color), whose point-set embeddings may require linearly many bends on linearly many edges. For a contrast, we show that two bends per edge are sufficient for 2-colored point-set embedding of properly 2-colored outerplanar graphs. For separable point sets this bound reduces to one, which is worst-case optimal. If the 2-coloring of the outerplanar graph is not proper, three bends per edge are sufficient and one bend per edge (which is worst-case optimal) is sufficient for caterpillars. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
24. (k,p)-planarity: A relaxation of hybrid planarity.
- Author
-
Di Giacomo, Emilio, Lenhart, William J., Liotta, Giuseppe, Randolph, Timothy W., and Tappini, Alessandra
- Subjects
- *
PLANAR graphs , *NP-complete problems , *EDGES (Geometry) - Abstract
We present a new model for hybrid planarity that relaxes existing hybrid representation models. A graph G = (V , E) is (k , p) -planar if V can be partitioned into clusters of size at most k such that G admits a drawing where: (i) each cluster is associated with a closed, bounded planar region, called a cluster region ; (ii) cluster regions are pairwise disjoint, (iii) each vertex v ∈ V is identified with at most p distinct points, called ports , on the boundary of its cluster region; (iv) each inter-cluster edge (u , v) ∈ E is identified with a Jordan arc connecting a port of u to a port of v ; (v) inter-cluster edges do not cross or intersect cluster regions except at their end-points. We first tightly bound the number of edges in a (k , p) -planar graph with p < k. We then prove that (4 , 1) -planarity testing and (2 , 2) -planarity testing are NP-complete problems. Finally, we prove that neither the class of (2 , 2) -planar graphs nor the class of 1-planar graphs contains the other, indicating that the (k , p) -planar graphs are a large and novel class. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
25. On the edge-length ratio of outerplanar graphs.
- Author
-
Lazard, Sylvain, Lenhart, William J., and Liotta, Giuseppe
- Subjects
- *
PLANAR graphs , *RATIO & proportion , *COMPUTATIONAL geometry - Abstract
Abstract We show that any outerplanar graph admits a planar straight-line drawing such that the length ratio of the longest to the shortest edges is strictly less than 2. This result is tight in the sense that for any ϵ > 0 there are outerplanar graphs that cannot be drawn with an edge-length ratio smaller than 2 − ϵ. We also show that this ratio cannot be bounded if the embeddings of the outerplanar graphs are given. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
26. On RAC drawings of 1-planar graphs.
- Author
-
Bekos, Michael A., Didimo, Walter, Liotta, Giuseppe, Mehrabi, Saeed, and Montecchiani, Fabrizio
- Subjects
- *
GRAPH theory , *RIGHT angle , *PATHS & cycles in graph theory , *PLANAR graphs , *LITERATURE reviews - Abstract
A drawing of a graph is 1-planar if each edge is crossed at most once. A graph is 1-planar if it has a 1-planar drawing. A k-bend RAC (Right Angle Crossing) drawing of a graph is a polyline drawing where each edge has at most k bends and edges cross only at right angles. A graph is k-bend RAC if it has a k -bend RAC drawing. A 0-bend RAC graph (drawing) is also called a straight-line RAC graph (drawing) . The relationships between 1-planar and k -bend RAC graphs have been partially studied in the literature. It is known that there are both 1-planar graphs that are not straight-line RAC and straight-line RAC graphs that are not 1-planar. The existence of 1-planar straight-line RAC drawings has been proven only for restricted families of 1-planar graphs. Two of the main questions still open are: ( i ) What is the complexity of deciding whether a graph has a drawing that is both 1-planar and straight-line RAC? ( i i ) Does every 1-planar graph have a drawing that is both 1-planar and 1-bend RAC? In this paper we answer these two questions. Namely, we prove an NP-hardness result for the first question, and we positively answer the second question by describing a drawing algorithm for 1-planar graphs. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
27. Simple k-planar graphs are simple (k + 1)-quasiplanar.
- Author
-
Angelini, Patrizio, Bekos, Michael A., Brandenburg, Franz J., Da Lozzo, Giordano, Di Battista, Giuseppe, Didimo, Walter, Hoffmann, Michael, Liotta, Giuseppe, Montecchiani, Fabrizio, Rutter, Ignaz, and Tóth, Csaba D.
- Subjects
- *
PLANAR graphs , *EDGES (Geometry) - Abstract
A simple topological graph is k -quasiplanar (k ≥ 2) if it contains no k pairwise crossing edges, and k -planar if no edge is crossed more than k times. In this paper, we explore the relationship between k -planarity and k -quasiplanarity to show that, for k ≥ 2 , every k -planar simple topological graph can be transformed into a (k + 1) -quasiplanar simple topological graph. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
28. [formula omitted]-page and [formula omitted]-page drawings with bounded number of crossings per edge.
- Author
-
Binucci, Carla, Giacomo, Emilio Di, Hossain, Md. Iqbal, and Liotta, Giuseppe
- Subjects
- *
GRAPH theory , *MATHEMATICAL bounds , *NUMBER theory , *PATHS & cycles in graph theory , *PLANAR graphs - Abstract
A drawing of a graph such that the vertices are drawn as points along a line and each edge is a circular arc in one of the two half-planes defined by this line is called a 2 -page drawing. If all edges are in the same half-plane, the drawing is called a 1 -page drawing. We want to compute 1 -page and 2 -page drawings of planar graphs such that the number of crossings per edge does not depend on the number of vertices. We show that for any constant k , there exist planar graphs that require more than k crossings per edge in both 1 -page and 2 -page drawings. We then prove that if the vertex degree is bounded by Δ , every planar 3-tree has a 2 -page drawing with a number of crossings per edge that only depends on Δ . Finally, we show a similar result for 1 -page drawings of partial 2 -trees. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
29. Recognizing and drawing IC-planar graphs.
- Author
-
Brandenburg, Franz J., Didimo, Walter, Evans, William S., Kindermann, Philipp, Liotta, Giuseppe, and Montecchiani, Fabrizio
- Subjects
- *
PLANAR graphs , *EDGES (Geometry) , *NP-hard problems , *POLYNOMIAL time algorithms , *RIGHT angle - Abstract
We give new results about the relationship between 1-planar graphs and RAC graphs . A graph is 1-planar if it has a drawing where each edge is crossed at most once. A graph is RAC if it can be drawn in such a way that its edges cross only at right angles. These two classes of graphs and their relationships have been widely investigated in the last years, due to their relevance in application domains where computing readable graph layouts is important to analyze or design relational data sets. We study IC-planar graphs , the sub-family of 1-planar graphs that admit 1-planar drawings with independent crossings (i.e., no two crossed edges share an endpoint). We prove that every IC-planar graph admits a straight-line RAC drawing, which may require however exponential area. If we do not require right angle crossings, we can draw every IC-planar graph with straight-line edges in linear time and quadratic area. We then study the problem of testing whether a graph is IC-planar. We prove that this problem is NP-hard, even if a rotation system for the graph is fixed. On the positive side, we describe a polynomial-time algorithm that tests whether a triangulated plane graph augmented with a given set of edges that form a matching is IC-planar. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.