Vai al contenuto principale della pagina
| Titolo: |
Graph algorithms and applications 5 [[electronic resource] /] / editors, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis
|
| Pubblicazione: | Singapore ; ; Hackensack, N.J., : World Scientific, c2006 |
| Descrizione fisica: | 1 online resource (378 p.) |
| Disciplina: | 005.133 |
| Soggetto topico: | Graph algorithms |
| Graph theory | |
| Soggetto genere / forma: | Electronic books. |
| Altri autori: |
LiottaGiuseppe
TamassiaRoberto <1960->
TollisIoannis G. <1958->
|
| Note generali: | "This book contains volume 8 of the Journal of graph algorithms and applications (JGAA)"--Pref. |
| Nota di bibliografia: | Includes bibliographical references. |
| Nota di contenuto: | Contents ; Volume 8:1 (2004) ; Drawing Planar Graphs with Large Vertices and Thick Edges ; The Maximum Number of Edges in a Three-Dimensional Grid-Drawing ; Extreme Distances in Multicolored Point Sets ; Fast Approximation of Centrality ; I/O-Optimal Algorithms for Outerplanar Graphs |
| A Note on Rectilinearity and Angular Resolution The Star Clustering Algorithm for Static and Dynamic Information Organization ; Volume 8:2 (2004) ; Special Issue on Selected Papers from the Tenth International Symposium on Graph Drawing GD 2002 | |
| Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio Drawing Graphs on Two and Three Lines. Sabine Cornelsen Thomas Schank and Dorothea Wagner ; Simple and Efficient Bilayer Cross Counting. Wilhelm Barth Petra Mutzel and Michael Jiinger | |
| Graph Drawing by High-Dimensional Embedding Computing and Drawing Isomorphic Subgraphs ; Volume 8:3 (2004) ; On the Cutting Edge: Simplified O(n) Planarity by Edge Addition ; Algorithms for Single Link Failure Recovery and Related Problems | |
| NP-Completeness of Minimal Width Unordered Tree Layout Algorithm and Experiments in Testing Planar Graphs for Isomorphism ; Three-Dimensional 1-Bend Graph Drawings | |
| Sommario/riassunto: | This book contains Volume 8 of the <i>Journal of Graph Algorithms and Applications</i> <i>(JGAA)</i><i>. JGAA</i> is a peer-reviewed scientific journal devoted to the publication of high-quality research papers on the analysis, design, implementation, and applications of graph algorithms. Areas of interest include computational biology, computational geometry, computer graphics, computer-aided design, computer and interconnection networks, constraint systems, databases, graph drawing, graph embedding and layout, knowledge representation, multimedia, software engineering, telecommunications ne |
| Titolo autorizzato: | Graph algorithms and applications 5 ![]() |
| ISBN: | 1-281-92466-0 |
| 9786611924669 | |
| 981-277-328-2 | |
| Formato: | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 9910450789603321 |
| Lo trovi qui: | Univ. Federico II |
| Opac: | Controlla la disponibilità qui |