Search

Your search keyword '"Di Battista, Giuseppe"' showing total 3 results
Start Over Author "Di Battista, Giuseppe" Topic topology
3 results on '"Di Battista, Giuseppe"'

1. Drawing Directed Acyclic Graphs: An Experimental Study.

Author

Di Battista, Giuseppe, Garg, Ashim, Liotta, Giuseppe, Parise, Armando, Tamassia, Roberto, Tassinari, Emanuele, Vargiu, Francesco, Vismara, Luca, and Kirkpatrick, D. G.

Subjects
*GRAPH theory, *ALGORITHMS, *TOPOLOGY
Abstract

In this paper we consider the important class of directed acyclic graphs (DAGs), and present the results of a comparative study on four popular drawing algorithms specifically developed for them. The study has been performed within a general experimental setting consisting of two large test suites of DAGs and a set of quality measures. The focus of the experiments has been the practical behavior of the algorithms with a geometric foundation compared to that of the algorithms with a topological foundation. The four algorithms exhibit various trade-offs with respect to the quality measures considered, and none of them clearly outperforms the others. Our analysis has motivated the development of a new hybrid strategy for drawing DAGs that performs quite well in practice. [ABSTRACT FROM AUTHOR]

Published
2000
Full Text
View/download PDF

2. Topological Morphing of Planar Graphs

Author

Giuseppe Di Battista, Maurizio Patrignani, Patrizio Angelini, Pier Francesco Cortese, Angelini, Patrizio, Cortese, Pierfrancesco, DI BATTISTA, Giuseppe, Patrignani, Maurizio, Ioannis G. Tollis, Maurizio Patrignani, Cortese, Pier Francesco, and Di Battista, Giuseppe

Subjects
Block graph, Book embedding, Planar straight-line graph, General Computer Science, ComputerApplications_COMPUTERSINOTHERSYSTEMS, Computer Science::Computational Geometry, Topology, Biconnected graph, Planar graph, Theoretical Computer Science, Combinatorics, symbols.namesake, Computer Science::Graphics, Dual graph, Computer Science::Discrete Mathematics, Outerplanar graph, symbols, Topological graph theory, Computer Science::Data Structures and Algorithms, Computer Science::Databases, Mathematics, MathematicsofComputing_DISCRETEMATHEMATICS
Abstract

In this paper we study how two planar embeddings of the same biconnected graph can be morphed one into the other while minimizing the number of elementary changes.

Published
2013

3. Planarization of Clustered Graphs

Author

A. Marcandalli, Walter Didimo, Giuseppe Di Battista, Petra Mutzel, Michael Junger, Sebastian Leipert, DI BATTISTA, Giuseppe, Walter, Didimo, and Alessandro, Marcandalli

Subjects
Theoretical computer science, topology-shape-metrics, Computer science, Topology (electrical circuits), Topology, Graph, Planar graph, symbols.namesake, Orthogonality, Cluster planarity, Planarization algorithm, orthogonal drawings, Dual graph, Chemical-mechanical planarization, Completeness (order theory), Metric (mathematics), symbols, Cluster analysis, MathematicsofComputing_DISCRETEMATHEMATICS
Abstract

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.

Published
2001

Catalog

Books, media, physical & digital resources
See catalog results