Graph Algorithms and Applications 3This 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: Triangle-Free Planar Graphs and Segment Intersection Graphs (N de Castro et al.); Traversing Directed Eulerian Mazes (S Bhatt et al.); A Fast Multi-Scale Method for Drawing Large Graphs (D Harel & Y Koren); GRIP: Graph Drawing with Intelligent Placement (P Gajer & S G Kobourov); Graph Drawing in Motion (C Friedrich & P Eades); A 6-Regular Torus Graph Family with Applications to Cellular and Interconnection Networks (M Iridon & D W Matula); and other papers. Readership: Researchers and practitioners in theoretical computer science, computer engineering, and combinatorics and graph theory. |
Contents
1 2002 | 4 |
Planar Graphs with Topological Constraints Christoph Dornheim | 27 |
Level Planar Embedding in Linear Time Michael Jünger and | 65 |
Few Bends Suffice for Planar Graphs | 115 |
Art of Graph Drawing and Art Jaroslav Nešetřil Communicated | 131 |
Realization of Posets Patrice Ossona de Mendez Communicated | 149 |
Traversing Directed Eulerian Mazes S Bhatt Shimon Even D Green | 157 |
Special Issue on Selected Papers from the 2000 | 177 |
Graph Drawing with Intelligent Placement Pawel Gajer | 203 |
A User Study in Similarity Measures for Graph Drawing Stina Bridge | 225 |
Other editions - View all
Graph Algorithms And Applications 3 Giuseppe Liotta,Roberto Tamassia,Ioannis G Tollis Limited preview - 2004 |
Graph Algorithms and Applications 3 Giuseppe Liotta,Roberto Tamassia,Ioannis G. Tollis Limited preview - 2004 |
Common terms and phrases
adjacent applied bends Bridgeman and Tamassia C-component c₁ Carmignani Castelló class diagrams collaboration diagrams components Condition connected corresponding cut vertex defined denoted directed distance Dornheim drawing algorithms edge crossings Eulerian exit exploration facial cycles Figure filtration Graph Algorithms Graph Drawing graph G Graphs with Constraints hamiltonian cycle Hausdorff distance HERMES hexagonal horizontal ignored nodes Intersection Graphs Iridon and Matula JGAA Jünger label Large Graphs Leipert Lemma Level Planar Embedding linear mental map merge operation Michael Kaufmann multi-scale non-ignored NP-complete number of vertices orthogonal drawings outgoing edges overlap constraints path pebble perform Planar Graphs point set PQ-tree preferred problem pseudo-convex face Q-node R₁ reduced extended form respect to Rx rotation scan secondary notation segment representation si(v sink indicators Statecharts subgraph T₁ Theorem topological constraints toroidal graph Torus Graph Family traversed tree triangular lattice Visualization of Statecharts