Graph Algorithms and Applications I
by Tamassia, Roberto; Tollis, Ioannis G.Format: Hardcover
Pub. Date: 2002-04-01
Publisher(s): WORLD SCIENTIFIC PUB CO INC
Other versions by this Author
List Price: $96.00
Rent Textbook
Select for Price
Rent Digital
$62.40*
New Textbook
We're Sorry
Sold Out
Used Textbook
We're Sorry
Sold Out
How Marketplace Works:
- This item is offered by an independent seller and not shipped from our warehouse
- Item details like edition and cover design may differ from our description; see seller's comments before ordering.
- Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
- Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
- Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.
Summary
Topics of interest include design and analysis of graph algorithms, experiences with graph algorithms, and applications of graph algorithms.
Table of Contents
| Volume 1:1-3 (1997) | p. 1 |
| 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms | p. 3 |
| Optimal Algorithms to Embed Trees in a Point Set | p. 29 |
| Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring | p. 45 |
| Volume 2:1-8 (1998) | p. 59 |
| Algorithms for Cluster Busting in Anchored Graph Drawing | p. 61 |
| A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs | p. 85 |
| A Visibility Representation for Graphs in Three Dimensions | p. 103 |
| Scheduled Hot-Potato Routing | p. 119 |
| Treewidth and Minimum Fill-in on d-trapezoid Graphs | p. 139 |
| Memory Paging for Connectivity and Path Problems in Graphs | p. 163 |
| New Lower Bounds For Orthogonal Drawings | p. 185 |
| Rectangle-visibility Layouts of Unions and Products of Trees | p. 217 |
| Volume 3:1-3 (1999) | p. 239 |
| Edge-Coloring and f-Coloring for Various Classes of Graphs | p. 241 |
| Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs | p. 259 |
| Subgraph Isomorphism in Planar Graphs and Related Problems | p. 283 |
| Volume 3:4 (1999) | p. 311 |
| Guest Editors' Introduction | p. 313 |
| Drawing Clustered Graphs on an Orthogonal Grid | p. 315 |
| A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs | p. 343 |
| Bounds for Orthogonal 3-D Graph Drawing | p. 375 |
| Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions | p. 393 |
| Table of Contents provided by Blackwell. All Rights Reserved. |
An electronic version of this book is available through VitalSource.
This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.
By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.
A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.
Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.
Please view the compatibility matrix prior to purchase.