| Description |
1 online resource (x, 366 pages) : illustrations |
| Contents |
Volume 8:1 (2004). Drawing planar graphs with large vertices and thick edges / Gill Barequet, Michael T. Goodrich and Chris Riley, communicated by Joseph S.B. Mitchell. The maximum number of edges in a three-dimensional grid-drawing / Prosenjit Bose [and others], communicated by Giuseppe Liotta. Extreme distances in multicolored point sets / Adrian Dumitrescu and Sumanta Guha, communicated by Michael T. Goodrich. Fast approximation of centrality. David Eppstein and Joseph Wang, communicated by Martin Fürer. I/O-optimal algorithms for outerplanar graphs / Anil Maheshwari and Norbert Zeh, communicated by Michael T. Goodrich. A note on rectilinearity and angular resolution / Hans L. Bodlaender and Gerard Tel, communicated by Dorothea Wagner. The star clustering algorithm for static and dynamic information organization / Javed A. Aslam, Ekaterina Pelekhov and Daniela Rus, communicated by Samir Khuller -- Volume 8:2 (2004). Special issue on selected papers from the Tenth International Symposium on Graph Drawing, GD 2002. Guest editor's Foreword / Xin He. Straight-line drawings of binary trees with linear area and arbitrary aspect ratio / Ashim Gary and Adrian Rusu, communicated by Xin He. Drawing graphs on two and three lines / Sabine Cornelsen, Thomas Schank and Dorothea Wagner, communicated by Xin He. Simple and efficient bilayer cross counting / Wilhelm Barth, Petra Mutzel and Michael Jünger, communicated by Xin He. Graph drawing by high-dimensional embedding / David Harel and Yehuda Koren, communicated by Xin He. Computing and drawing isomorphic subgraphs / Sabine Bachl, Franz J. Brandenburg and Daniel Gmach, communicated by Xin He -- Volume 8:3 (2004). On the cutting edge: simplified O(n) planarity by edge addition / John M. Boyer and Wendy J. Myrvold, communicated by Peter Eades. Algorithms for single link failure recovery and related problems / Amit M. Bhosle and Teofilo F. Gonzalez, communicated by Balaji Raghavachari. NP-completeness of minimal width unordered tree layout / Kim Marriott and Peter J. Stuckey, communicated by Michael Kaufmann. Algorithm and experiments in testing planar graphs for isomorphism / Jacek P. Kukluk, Lawrence B. Holder and Diane J. Cook, communicated by Giuseppe Liotta. Three-dimensional 1-bend graph drawings / Pat Morin and David R. Wood, communicated by Giuseppe Liotta |
| Summary |
Annotation 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 |
| Notes |
"This book contains volume 8 of the Journal of graph algorithms and applications (JGAA)"--Preface |
| Bibliography |
Includes bibliographical references |
| Notes |
Print version record |
| Subject |
Graph algorithms.
|
|
Graph theory.
|
|
MATHEMATICS -- Graphic Methods.
|
|
Graph algorithms
|
|
Graph theory
|
| Form |
Electronic book
|
| Author |
Liotta, Giuseppe.
|
|
Tamassia, Roberto, 1960-
|
|
Tollis, Ioannis G., 1958-
|
| ISBN |
9812773282 |
|
9789812773289 |
|
