Graph Algorithms and Applications 5.
Title:
Graph Algorithms and Applications 5.
Author:
Liotta, Giuseppe.
ISBN:
9789812773289
Personal Author:
Physical Description:
1 online resource (378 pages)
Contents:
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.
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 papers. Readership: Researchers and practitioners in theoretical computer science, computer engineering, and combinatorics and graph theory.
Local Note:
Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2017. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.
Genre:
Electronic Access:
Click to View