did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

We're the #1 textbook rental company. Let us show you why.

9783540667315

Graph-Theoretic Concepts in Computer Science : 25th International Workshop, WG'99, Ascona, Switzerland, June 17-19, 1999 Proceedings

by ; ; ; ; ;
  • ISBN13:

    9783540667315

  • ISBN10:

    3540667318

  • Format: Paperback
  • Copyright: 1999-01-01
  • Publisher: Springer Verlag
  • Purchase Benefits
List Price: $119.00

Summary

This book constitutes the refereed proceedings of the 25th International Workshop on Graph-Theorie Concepts in Computer Science WG'99, held at the Centre Stefano Frascini on Monte Verita, Ascona, Switzerland in June 1999. The 33 revised full papers presented together with four invited contributions were carefully reviewed and selected from 64 papers submitted. The papers provide a wealth of new results for various graph classes, graph computations, graph algorithms and graph-theoretical applications in a variety of fields.

Table of Contents

Invited Lecture: Silver Graphs: Achievements and New Challengesp. 1
Invited Lecture: Online Algorithms: A Studyof Graph-Theoretic Conceptsp. 10
Invited Lecture: Discrete Optimization Methods for Packing Problems in Two and Three Dimensions - With Applications in the Textile and
Car Manufacturing Industriesp. 27
Informatica, Scuola, Communita: Uno Sguardo dall' Occhio del Ciclonep. 29
Proximity-Preserving Labeling Schemes and Their Applicationsp. 30
Euler is Standing in Linep. 42
Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2p. 55
ComplexityClassification of Some Edge Modification Problemsp. 65
On Minimum Diameter Spanning Trees under Reload Costsp. 78
Induced Matchings in Regular Graphs and Treesp. 89
Mod-2 Independence and Domination in Graphsp. 101
NLC2-Decomposition in Polynomial Timep. 110
On the Nature of Structure and Its Identificationp. 122
On the Clique-Width of Perfect Graph Classesp. 135
An Improved Algorithm for Finding Tree Decompositions of Small Widthp. 148
Efficient Analysis of Graphs with Small Minimal Separatorsp. 155
Generating All the Minimal Separators of a Graphp. 167
Two Broadcasting Problems in FaultyHypercubesp. 173
Routing Permutations in the Hypercubep. 179
An Optimal Fault-Tolerant Routing for Triconnected Planar Graphsp. 191
Optimal Irreversible Dynamos in Chordal Ringsp. 202
Recognizing Bipartite Incident-Graphs of Circulant Digraphsp. 215
Optimal Cuts for Powers of the Petersen Graphp. 228
Dihamiltonian Decomposition of Regular Graphs with Degree Threep. 240
Box-Rectangular Drawings of Plane Graphsp. 250
A Multi-Scale Algorithm for Drawing Graphs Nicelyp. 262
All Separating Triangles in a Plane Graph Can Be Optimally "Broken" in Polynomial Timep. 278
Linear Orderings of Random Geometric Graphsp. 291
Finding Smallest Supertrees Under Minor Containmentp. 303
Vertex Cover: Further Observations and Further Improvementsp. 313
On the Hardness of Recognizing Bundles in Time Table Graphsp. 325
Optimal Solutions for FrequencyAssignment Problems via Tree Decompositionp. 338
Fixed-Parameter Complexity of ¿-Labelingsp. 350
Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphsp. 364
On Claw-Free Asteroidal Triple-Free Graphsp. 377
Vertex Partitioning of Crown-Free Interval Graphsp. 391
Triangulated Neighbourhoods in C4-Free Berge Graphsp. 402
Author Indexp. 413
Table of Contents provided by Publisher. All Rights Reserved.

Supplemental Materials

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Rewards Program