7,340 research outputs found
Computing NodeTrix Representations of Clustered Graphs
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. We study the complexity of constructing
NodeTrix representations focusing on planarity testing problems, and we show
several NP-completeness results and some polynomial-time algorithms. Building
on such algorithms we develop a JavaScript library for NodeTrix representations
aimed at reducing the crossings between edges incident to the same matrix.Comment: Appears in the Proceedings of the 24th International Symposium on
Graph Drawing and Network Visualization (GD 2016
Hierarchical Partial Planarity
In this paper we consider graphs whose edges are associated with a degree of
{\em importance}, which may depend on the type of connections they represent or
on how recently they appeared in the scene, in a streaming setting. The goal is
to construct layouts of these graphs in which the readability of an edge is
proportional to its importance, that is, more important edges have fewer
crossings. We formalize this problem and study the case in which there exist
three different degrees of importance. We give a polynomial-time testing
algorithm when the graph induced by the two most important sets of edges is
biconnected. We also discuss interesting relationships with other
constrained-planarity problems.Comment: Conference version appeared in WG201
Pole Dancing: 3D Morphs for Tree Drawings
We study the question whether a crossing-free 3D morph between two
straight-line drawings of an -vertex tree can be constructed consisting of a
small number of linear morphing steps. We look both at the case in which the
two given drawings are two-dimensional and at the one in which they are
three-dimensional. In the former setting we prove that a crossing-free 3D morph
always exists with steps, while for the latter steps
are always sufficient and sometimes necessary.Comment: Appears in the Proceedings of the 26th International Symposium on
Graph Drawing and Network Visualization (GD 2018
Self-organized criticality in a model of collective bank bankruptcies
The question we address here is of whether phenomena of collective
bankruptcies are related to self-organized criticality. In order to answer it
we propose a simple model of banking networks based on the random directed
percolation. We study effects of one bank failure on the nucleation of
contagion phase in a financial market. We recognize the power law distribution
of contagion sizes in 3d- and 4d-networks as an indicator of SOC behavior. The
SOC dynamics was not detected in 2d-lattices. The difference between 2d- and
3d- or 4d-systems is explained due to the percolation theory.Comment: For Int. J. Mod. Phys. C 13, No. 3, six pages including four figure
Transonic small disturbances equation applied to the solution of two-dimensional nonsteady flows
Transonic nonsteady flows are of large practical interest. Aeroelastic instability prediction, control figured vehicle techniques or rotary wings in forward flight are some examples justifying the effort undertaken to improve knowledge of these problems is described. The numerical solution of these problems under the potential flow hypothesis is described. The use of an alternating direction implicit scheme allows the efficient resolution of the two dimensional transonic small perturbations equation
Simultaneous Orthogonal Planarity
We introduce and study the problem: Given planar
graphs each with maximum degree 4 and the same vertex set, do they admit an
OrthoSEFE, that is, is there an assignment of the vertices to grid points and
of the edges to paths on the grid such that the same edges in distinct graphs
are assigned the same path and such that the assignment induces a planar
orthogonal drawing of each of the graphs?
We show that the problem is NP-complete for even if the shared
graph is a Hamiltonian cycle and has sunflower intersection and for
even if the shared graph consists of a cycle and of isolated vertices. Whereas
the problem is polynomial-time solvable for when the union graph has
maximum degree five and the shared graph is biconnected. Further, when the
shared graph is biconnected and has sunflower intersection, we show that every
positive instance has an OrthoSEFE with at most three bends per edge.Comment: Appears in the Proceedings of the 24th International Symposium on
Graph Drawing and Network Visualization (GD 2016
Prefazione
Le politiche sullâambiente assumono un ruolo fondamentale e sempre piĂč importante, perchĂ© possono riuscire a modificare quei comportamenti che, se accompagnati a politiche economiche di sostenibilitĂ , possono permetterci di raggiungere un equilibrio tra la salvaguardia delle risorse naturali esistenti, e un loro corretto utilizzo, in modo da proteggerne lâintegritĂ .
Il volume contiene i contributi presentati in occasione del convegno organizzato dallâAIL e dallâUniversitĂ degli studi di Palermo su âCancerogenesi Ambientaleâ (Palermo 2013)
A Universal Point Set for 2-Outerplanar Graphs
A point set is universal for a class if
every graph of has a planar straight-line embedding on . It is
well-known that the integer grid is a quadratic-size universal point set for
planar graphs, while the existence of a sub-quadratic universal point set for
them is one of the most fascinating open problems in Graph Drawing. Motivated
by the fact that outerplanarity is a key property for the existence of small
universal point sets, we study 2-outerplanar graphs and provide for them a
universal point set of size .Comment: 23 pages, 11 figures, conference version at GD 201
Euclidean Greedy Drawings of Trees
Greedy embedding (or drawing) is a simple and efficient strategy to route
messages in wireless sensor networks. For each source-destination pair of nodes
s, t in a greedy embedding there is always a neighbor u of s that is closer to
t according to some distance metric. The existence of greedy embeddings in the
Euclidean plane R^2 is known for certain graph classes such as 3-connected
planar graphs. We completely characterize the trees that admit a greedy
embedding in R^2. This answers a question by Angelini et al. (Graph Drawing
2009) and is a further step in characterizing the graphs that admit Euclidean
greedy embeddings.Comment: Expanded version of a paper to appear in the 21st European Symposium
on Algorithms (ESA 2013). 24 pages, 20 figure
- âŠ