Results 11 to 20 of about 149,182 (235)
Atomic Embeddability, Clustered Planarity, and Thickenability [PDF]
Journal of the ACM, 2020 We study the atomic embeddability testing problem, which is a common generalization of clustered planarity ( c-planarity , for short) and thickenability testing, and present a polynomial-time algorithm for this problem, thereby giving the first polynomial-time algorithm for c-planarity.
Radoslav Fulek, Csaba D. Tóth
openaire +7 more sources
Clustered Planarity: Small Clusters in Eulerian Graphs [PDF]
, 2008 We present several polynomial-time algorithms for c-planarity testing for clustered graphs with clusters of size at most three. The most general result concerns a special class of Eulerian graphs, namely graphs obtained froma fixed-size 3-connected graph bymultiplying and then subdividing edges.
Eva Jelínková +5 more
openaire +3 more sources
NodeTrix Planarity Testing with Small Clusters [PDF]
Algorithmica, 2018 We study the NodeTrix planarity testing problem for flat clustered graphs when the maximum size of each cluster is bounded by a constant $k$. We consider both the case when the sides of the matrices to which the edges are incident are fixed and the case when they can be chosen arbitrarily. We show that NodeTrix planarity testing with fixed sides can be
Di Giacomo E. +4 more
core +9 more sources
Clustered Planarity Variants for Level Graphs [PDF]
CoRRWe consider variants of the clustered planarity problem for level-planar drawings. So far, only convex clusters have been studied in this setting. We introduce two new variants that both insist on a level-planar drawing of the input graph but relax the requirements on the shape of the clusters.
Simon D. Fink +3 more
core +7 more sources
Constrained Planarity in Practice -- Engineering the Synchronized Planarity Algorithm [PDF]
Journal of Graph Algorithms and ApplicationsIn the constrained planarity setting, we ask whether a graph admits a planar drawing that additionally satisfies a given set of constraints. These constraints are often derived from very natural problems; prominent examples are Level Planarity, where ...
Simon Dominik Fink, Ignaz Rutter
doaj +3 more sources
Splitting Clusters to Get C-Planarity [PDF]
, 2010 In this paper we introduce a generalization of the c-planarity testing problem for clustered graphs. Namely, given a clustered graph, the goal of the Split-C-Planarity problem is to split as few clusters as possible in order to make the graph c-planar. Determining whether zero splits are enough coincides with testing c-planarity.
Patrizio Angelini +2 more
openaire +4 more sources
A Note on Obstructions to Clustered Planarity [PDF]
The Electronic Journal of Combinatorics, 2011 A planar digraph $D$ is clustered planar if in some planar embedding of $D$ we have at each vertex the in-arcs occurring sequentially in the local rotation. By supplementing the operations used to form the usual minors in Kuratowski's theorem, clustered planar digraphs are characterised.
Sneddon, Jamie, Bonnington, Paul
openaire +5 more sources
Exact Algorithms for Clustered Planarity with Linear Saturators [PDF]
CoRRBibliografija: str. 14-16.
Giordano Da Lozzo +5 more
core +9 more sources
Overlapping cluster planarity [PDF]
2007 6th International Asia-Pacific Symposium on Visualization, 2007 Summary: This paper investigates a new direction in the area of cluster planarity by addressing the following question: Let G be a graph along with a hierarchy of vertex clusters, where clusters can partially intersect. Does G admit a drawing where each cluster is inside a simple closed region, no two edges intersect, and no edge intersects a region ...
DIDIMO, WALTER +2 more
openaire +5 more sources
IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2021 Discontinuity sets play an essential and pivotal role in the deformation monitoring and stability analysis of the rock mass, but there are still many challenges for accurately and rapidly extracting discontinuity.
Wenxiao Sun +3 more
doaj +1 more source