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

Format:

Book

Contributor:

Liotta, Giuseppe, Ph. D.

Tamassia, Roberto, 1960-

Tollis, Ioannis G., 1958-

Language:

English

Subjects (All):

Graph algorithms.

Graph theory.

Physical Description:

1 online resource (412p.)

Edition:

1st ed.

Other Title:

Graph algorithms and applications three

Place of Publication:

River Edge, N.J. : World Scientific, c2004.

Language Note:

English

Summary:

This book contains Volume 6 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 3 presents contributions from prominent authors and includes selected papers from the Symposium on Graph Drawing (1999 and 2000). All papers in the book have extensive diagrams and offer a unique treatment of graph algorithms focusing on the important applications.

Contents:

Volume 6:1 (2002). Special issue on graph drawing and representations: selected papers from the 1999 symposium on graph drawing. Guest editors: Hubert de Praysseix and Jan Kratochvil. Guest editors' foreword / Hubert de Fraysseix and Jan Kratochvil. Triangle-free planar graphs and segment intersection graphs / Natalia de Castro ... [et al.]. Communicated by Hubert de Fraysseix and Jan Kratochvil. Planar graphs with topological constraints / Christoph Dornheim. Communicated by Hubert de Fraysseix and Jan Kratochvil. Level planar embedding in linear time / Michael Jünger and Sebastian Leipert. Communicated by Hubert de Fraysseix and Jan Kratochvil. Embedding vertices at points: few bends suffice for planar graphs / Michael Kaufmann and Roland Wiese. Communicated by Hubert de Fraysseix and Jan Kratochvil. Art of graph drawing and art / Jaroslav Nešetřil. Communicated by Hubert de Fraysseix and Jan Kratochvil. Realization of Posets / Patrice Ossona de Mendez. Communicated by Hubert de Fraysseix and Jan Kratochvil

Volume 6:2 (2002). Traversing directed Eulerian mazes / S. Bhatt ... [et al.]. Communicated by Samir Khuller

Volume 6:3 (2002). Special issue on selected papers from the 2000 symposium on graph drawing. Guest editors: Michael Kaufmann. Guest editor's foreword / Michael Kaufmann. A fast multi-scale method for drawing large graphs / David Harel and Yehuda Koren. Communicated by Michael Kaufmann. GRIP: graph drawing with intelligent placement / Pawel Gajer and Stephen G. Kobourov. Communicated by Michael Kaufmann. A user study in similarity measures for graph drawing / Stina Bridgeman and Roberto Tamassia. Communicated by Michael Kaufmann. Graph layout aesthetics in UML diagrams: user preferences / Helen C. Purchase, Jo-Anne Allder and David Carrington. Communicated by Michael Kaufmann. Visualization of the high level structure of the internet with Hermes / Andrea Carmignani ... [et al.]. Communicated by Michael Kaufmann. A framework for the static and interactive visualization of statecharts / Rodolfo Castelló, Rym Mili and Ioannis G. Tollis. Communicated by Michael Kaufmann. Graph drawing in motion / Carsten Friedrich and Peter Eades. Communicated by Michael Kaufmann

Volume 6:4 (2002). A 6-regular Torus graph family with applications to cellular and interconnection networks / Mihaela Iridon and David W. Matula. Communicated by Balaji Raghavachari.

Notes:

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

Includes bibliographical references.

ISBN:

9786611955991

9781281955999

128195599X

9789812796608

9812796606

OCLC:

815755877