Results 21 to 30 of about 149,182 (235)
Planarity-Preserving Clustering and Embedding for Large Planar Graphs [PDF]
Computational Geometry, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christian A. Duncan +2 more
openaire +4 more sources
Planarization of Clustered Graphs [PDF]
, 2002 We propose a planarization algorithm for clustered graphs and experimentally test its efficiency and effectiveness. Further, we integrate our planarization strategy into a complete topology-shape-metrics algorithm for drawing clustered graphs in the orthogonal drawing convention.
Di Battista G. +2 more
openaire +3 more sources
Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
Journal of Graph Algorithms and Applications, 2013 We study Hanani-Tutte style theorems for various notions of planarity, including partially embedded planarity and simultaneous planarity. This approach brings together the combinatorial, computational and algebraic aspects of planarity notions and may ...
Marcus Schaefer
doaj +1 more source
Two Simple and Reliable Metrics of Molecular Planarity: Molecular Planarity Parameter (MPP) and Span of Deviation from Plane (SDP) [PDF]
, 2021 Planarity is a very important structural character of molecules, which is closely related to many molecular properties. However, there is currently no simple, universal, and robust way to measure molecular planarity. In order to fill this evident gap, we
Tian, Lu
core +1 more source
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
Journal of Graph Algorithms and Applications, 2009 Let C be a clustered graph and suppose that the planar embedding of its underlying graph is fixed. Is testing the c-planarity of C easier than in the variable embedding setting?
Giuseppe Di Battista, Fabrizio Frati
doaj +1 more source
Clustering Cycles into Cycles of Clusters
Journal of Graph Algorithms and Applications, 2005 In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying graph is a simple cycle and there are three clusters all at the same level.
Pier Francesco Cortese +3 more
doaj +1 more source
Intersection-Link Representations of Graphs
Journal of Graph Algorithms and Applications, 2017 We consider drawings of graphs that contain dense subgraphs. We introduce intersection-link representations for such graphs, in which each vertex $u$ is represented by a geometric object $R(u)$ and each edge $(u,v)$ is represented by the intersection ...
Patrizio Angelini +5 more
doaj +1 more source
Computing NodeTrix Representations of Clustered Graphs
Journal of Graph Algorithms and Applications, 2018 NodeTrix representations are a popular way to visualize clustered graphs; they represent clusters as adjacency matrices and inter-cluster edges as curves connecting the matrix boundaries.
Giordano Da Lozzo +3 more
doaj +1 more source
Planarity of Overlapping Clusterings Including Unions of Two Partitions
Journal of Graph Algorithms and Applications, 2017 We consider clustered planarity with overlapping clusters as introduced by Didimo et al. (Didimo, Giordano, Liotta, JGAA, 2008). It can be deduced from a proof in Athenstädt et al. (J. C. Athenstädt, T. Hartmann, and M.
Jan Christoph Athenstädt +1 more
doaj +1 more source
Synchronized Planarity with Applications to Constrained Planarity Problems [PDF]
, 2023 We introduce the problem Synchronized Planarity. Roughly speaking, its input is a loop-free multi-graph together with synchronization constraints that, e.g., match pairs of vertices of equal degree by providing a bijection between their edges ...
Fink, Simon D. +2 more
core +1 more source