(Ebook) Graph Algorithms and Applications I by Roberto Tamassia, Ioannis G. Tollis ISBN 9789810249267, 9810249268

(Ebook) Graph Algorithms and Applications I by Roberto Tamassia, Ioannis G. Tollis ISBN 9789810249267, 9810249268

This book contains volumes 1-3 of the Journal of Graph Algorithms and Applications (JGAA). Topics of interest include design and analysis of graph algorithms, experiences with graph algorithms, and applications of graph algorithms. JGAA is supported by distinguished advisory and editorial boards, has high scientific standards, and takes advantage of current electronic document technology. Contents: Volume 1: 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms (M Jünger & P Mutzel); Optimal Algorithms to Embed Trees in a Point Set (P Bose et al.); Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring (M M Halldórsson & H C Lau); Volume 2: Algorithms for Cluster Busting in Anchored Graph Drawing (K A Lyons et al.); A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs (L Bai et al.); A Visibility Representation for Graphs in Three Dimensions (P Bose et al.); Scheduled Hot-Potato Routing (J Naor et al.); Treewidth and Minimum Fill-in on d-trapezoid Graphs (H L Bodlaender et al.); Memory Paging for Connectivity and Path Problems in Graphs (E Feuerstein & A Marchetti-Spaccamela); New Lower Bounds for Orthogonal Drawings (T C Biedl); Rectangle-visibility Layouts of Unions and Products of Trees (A M Dean & J P Hutchinson); Volume 3: Edge-Coloring and f-Coloring for Various Classes of Graphs (X Zhou & T Nishizeki); Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs (T Calamoneri et al.); Subgraph Isomorphism in Planar Graphs and Related Problems (D Eppstein); Guest Editors' Introduction (G Di Battista & P Mutzel); Drawing Clustered Graphs on an Orthogonal Grid (P Eades et al.); A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs (M S Rahman et al.); Bounds for Orthogonal 3-D Graph Drawing (T Biedl et al.); Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions (A Papakostas & I G Tollis).