This book contains Volume 8 of the Journal of Graph Algorithms and Applications (JGAA). JGAA 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 networks, user interfaces and visualization, and VLSI circuit design. Graph Algorithms and Applications 5 presents contributions from prominent authors and includes selected papers from the Tenth International Symposium on Graph Drawing (GD 2002). All papers in the book have extensive diagrams and offer a unique treatment of graph algorithms focusing on the important applications. Contents: * Drawing Planar Graphs with Large Vertices and Thick Edges (G Barequet et al.) * Fast Approximation of Centrality (D Eppstein & J Wang) * Simple and Efficient Bilayer Cross Counting (W Barth et al.) * Algorithms for Single Link Failure Recovery and Related Problems (A M Bhosle & T F Gonzalez) * and other papers
GRAPH ALGORITHMS AND APPLICATIONS 5
LIOTTA, Giuseppe;
2006
Abstract
This book contains Volume 8 of the Journal of Graph Algorithms and Applications (JGAA). JGAA 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 networks, user interfaces and visualization, and VLSI circuit design. Graph Algorithms and Applications 5 presents contributions from prominent authors and includes selected papers from the Tenth International Symposium on Graph Drawing (GD 2002). All papers in the book have extensive diagrams and offer a unique treatment of graph algorithms focusing on the important applications. Contents: * Drawing Planar Graphs with Large Vertices and Thick Edges (G Barequet et al.) * Fast Approximation of Centrality (D Eppstein & J Wang) * Simple and Efficient Bilayer Cross Counting (W Barth et al.) * Algorithms for Single Link Failure Recovery and Related Problems (A M Bhosle & T F Gonzalez) * and other papersI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
