Graph algorithms and applications 5 / editors, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis.

Format:

Book

Contributor:

Liotta, Giuseppe.

Tamassia, Roberto, 1960-

Tollis, Ioannis G., 1958-

Language:

English

Subjects (All):

Graph algorithms.

Graph theory.

Physical Description:

1 online resource (378 p.)

Edition:

1st ed.

Other Title:

Graph algorithms and applications five

Graph algorithms & applications 5

Place of Publication:

Singapore ; Hackensack, N.J. : World Scientific, c2006.

Language Note:

English

Summary:

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

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

Notes:

"This book contains volume 8 of the Journal of graph algorithms and applications (JGAA)"--Pref.

Includes bibliographical references.

ISBN:

9786611924669

9781281924667

1281924660

9789812773289

9812773282

OCLC:

879025514