Graph-Theoretic Concepts in Computer Science

28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers

By: Ludek Kucera (Editor)

Write A Review

Paperback | 13 December 2002

At a Glance

Paperback
440 Pages

Dimensions(cm)
23.5 x 15.24 x 1.91

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

The 28th International Workshop on Graph-Theoretic Concepts in Computer ? Science (WG 2002) was held in Cesky ´ Krumlov, a beautiful small town in the southern part of the Czech Republic on the river Vltava (Moldau), June 13-15, 2002. The workshop was organized by the Department of Applied Mathematics of the Faculty of Mathematics and Physics of Charles University in Prague. Since 1975, WG has taken place in Germany 20 times, twice in Austria and The Netherlands, and once in Italy, Slovakia, and Switzerland. As in previous years, the workshop aimed at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in Computer Science, or by extracting new problems from applications.The workshop was devoted to the theoretical and practical aspects of graph concepts in computer science, and its contributed talks showed how recent research results from algorithmic graph theory can be used in computer science and which graph-theoretic questions arise from new developments in computer science. Altogether 61 research papers were submitted and reviewed by the program committee. The program committee represented the wide scienti?c spectrum, and in a careful reviewing process with four reports per submission it selected 36papersforpresentationattheworkshop.Thereferees'commentsaswellasthe numerous fruitful discussions during the workshop have been taken into account by the authors of these conference proceedings.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $0.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Computing & I.T.Computer Science Computer Architecture & Logic Design Medicine Medicine in General Mathematical Theory of Computation Graphical & Digital Media Applications 3D Graphics & Modelling Business Applications Mathematical & Statistical Software Databases

Data Capture & Analysis Computer Programming & Software Development Algorithms & Data Structures Mathematics

Maximum Cardinality Search for Computing Minimal Triangulations	p. 1
DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem	p. 13
On the Minimum Size of a Contraction-Universal Tree	p. 25
Optimal Area Algorithm for Planar Polyline Drawings	p. 35
Cycles in Generalized Networks	p. 47
New Graph Classes of Bounded Clique-Width	p. 57
More about Subcolorings	p. 68
Search in Indecomposable Graphs	p. 80
On the Complexity of (k,l)-Graph Sandwich Problems	p. 92
Algorithms and Models for the On-Line Vertex-Covering	p. 102
Weighted Node Coloring: When Stable Sets Are Expensive	p. 114
The Complexity of Restrictive H-Coloring	p. 126
A New 3-Color Criterion for Planar Graphs	p. 138
An Additive Stretched Routing Scheme for Chordal Graphs	p. 150
Complexity of Pattern Coloring of Cycle Systems	p. 164
Safe Reduction Rules for Weighted Treewidth	p. 176
Graph Separator Algorithms: A Refined Analysis	p. 186
Generalized H-Coloring and H-Covering of Trees	p. 198
The Complexity of Approximating the Oriented Diameter of Chordal Graphs	p. 211
Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies	p. 223
Completely Independent Spanning Trees in Maximal Planar Graphs	p. 235
Facets of the Directed Acyclic Graph Layering Polytope	p. 246
Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP	p. 258
Complexity of Some Infinite Games Played on Finite Graphs	p. 270
New Algorithms for k-Face Cover, k-Feedback Vertex Set, k-Disjoint Cycles on Plane and Planar Graphs	p. 282
A Multi-scale Algorithm for the Linear Arrangement Problem	p. 296
On the b-Chromatic Number of Graphs	p. 310
Budgeted Maximum Graph Coverage	p. 321
Online Call Admission in Optical Networks with Larger Demands	p. 333
The Forest Wrapping Problem on Outerplanar Graphs	p. 345
On the Recognition of P[subscript 4]-Comparability Graphs	p. 355
Bend-Minimum Orthogonal Drawings of Plane 3-Graphs	p. 367
Cluster Graph Modification Problems	p. 379
Two Counterexamples in Graph Drawing	p. 391
Connected and Loosely Connected List Homomorphisms	p. 399
Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal	p. 413
Author Index	p. 421
Table of Contents provided by Blackwell. All Rights Reserved.

Graph-Theoretic Concepts in Computer Science

28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Computer Science

Don't Burn Anyone at the Stake Today

(and other lessons from history about living through an information crisis)

The Laws of Thought

The Quest for a Mathematical Theory of the Mind

Nexus

A Brief History of Information Networks from the Stone Age to AI

If Anyone Builds It, Everyone Dies

The Case Against Superintelligent AI

Storytelling with Data

A Data Visualization Guide for Business Professionals, 10th Anniversary Edition

Microsoft 365 Excel All-in-One For Dummies

Excel for Dummies

The AI-Driven Leader

Harnessing AI to Make Faster, Smarter Decisions

Microsoft 365 Excel For Dummies

For Dummies (Computer/Tech)

The AI Con

How To Fight Big Tech's Hype and Create the Future We Want

Python All-in-One For Dummies

3rd Edition

Hope in the Library

How Libraries Can Help Shape Our Future with Artificial Intelligence

A Practitioner's Guide to Advancing Behavioral Health Care with Artificial Intelligence

Microsoft Power BI For Dummies

For Dummies (Computer/Tech)

Audio Effects

Theory, Implementation and Application

Audio Effects

Theory, Implementation and Application

Decoding Despair

How AI is Reshaping Psychiatry

Agentic AI For Dummies

For Dummies (Computer/Tech)

The AI Cybersecurity Handbook

AI for Business

A Guide to AI Adoption

Artificial Intelligence and Higher Education

The Impact of AI on Business Students Learning

Integrated Energy Systems with a Carnot Battery

A Pathway to Low-Carbon Energy Systems

Handbook on Integrating Smart Technologies for Sustainable Development

Smart Technologies for Engineers and Scientists

Generative AI for Communications Systems

Fundamentals, Applications, and Prospects

AI and Data Science in Healthcare 5.0

Medical Robots and Devices: New Developments and Advances

This product is categorised by