Graph algorithms and applications I
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, ha...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
World Scientific Publishing Co. Pte. Ltd
2002
WORLD SCIENTIFIC World Scientific Publishing |
| Subjects: | |
| ISBN: | 9810249268, 9789810249267 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- Graph algorithms and applications I -- Contents -- Volume 1:1-3 (1997) -- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms -- Optimal Algorithms to Embed Trees in a Point Set -- Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction Max Cut and Coloring -- Volume 2:1-8 (1998) -- Algorithms for Cluster Busting in Anchored Graph Drawing -- A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs -- A Visibility Representation for Graphs in Three Dimensions -- Scheduled Hot-Potato Routing -- Treewidth and Minimum Fill-in on d-trapezoid Graphs -- Memory Paging for Connectivity and Path Problems in Graphs -- New Lower Bounds For Orthogonal Drawings -- Rectangle-visibility Layouts of Unions and Products of Trees -- Volume 3:1-3 (1999) -- Edge-Coloring and f-Coloring for Various Classes of Graphs -- Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs -- Subgraph Isomorphism in Planar Graphs and Related Problems -- Volume 3:4 (1999) -- New Trends in Graph Drawing Special Issue on Selected Papers from the 1997 Symposium on Graph Drawing -- Drawing Clustered Graphs on an Orthogonal Grid -- A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs -- Bounds for Orthogonal 3-D Graph Drawing -- Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions.

