Università degli Studi di Roma 3 ArcA diA
Archivio Aperto di Ateneo

ArcAdiA >
Tipologia di Documenti >
T - Tesi di dottorato >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2307/503

Title: Small Screens and Large Graphs: Area-Effcient Drawings of Planar Combinatorial Structures
Authors: Frati, Fabrizio
Tutor: Di, Battista Giuseppe
Issue Date: 2-Apr-2009
Publisher: Universit√† degli studi Roma Tre
Abstract: Small Screens and Large Graphs: Area-Efficient Drawings of Planar Combinatorial Structures Fabrizio Frati Dipartimento di Informatica e Automazione - Roma Tre University Abstract Graphs are the most widely used data structures to represent relationships among objects. Maps, networks, circuits, molecules, compounds are a few examples of structures that are commonly represented by graphs. The clearest way to express the information conveyed in a graph is to visualize it. Namely, a dra
URI: http://hdl.handle.net/2307/503
Appears in Collections:X_Dipartimento di Informatica e automazione
T - Tesi di dottorato

Files in This Item:

File Description SizeFormat
SmallScreensLargeGraphsFrati.pdf2.93 MBAdobe PDF

This item is protected by original copyright

Recommend this item

SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Università degli Studi RomaTre SBA - Sistema Bibliotecario di Ateneo ICT support by CINECA