Graph-Theoretic Concepts in Computer Science

29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers

Häftad, Engelska, 2003

689 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the thoroughly refereed postproceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2003, held in Elspeet, The Netherlands in June 2003.The 30 revised full papers presented together with 2 invited papers were carefully reviewed, improved, and selected from 78 submissions. The papers present a wealth of new results for various classes of graphs, graph computations, graph algorithms, and graph-theoretical applications in various felds.

Produktinformation

Utgivningsdatum2003-10-29
Mått155 x 235 x 22 mm
Vikt610 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor392
Upplaga2003
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540204527

Tillhör följande kategorier

3D-grafik och modellering inom Data och it
Systemvetenskap och AI inom Data och it
Diskret matematik inom Naturvetenskap och teknik
Beräkning och matematisk analys inom Naturvetenskap och teknik
Programmeringsböcker inom Data och it
Databaser inom Data och it

Invited Lecture.- Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT.- Matching, Edge-Colouring, and Dimers.- Regular Papers.- Minimum Flow Time Graph Ordering.- Searching Is Not Jumping.- Incremental Integration Tools for Chemical Engineering: An Industrial Application of Triple Graph Grammars.- The Minimum Degree Heuristic and the Minimal Triangulation Process.- Generalized Parametric Multi-terminal Flows Problem.- Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation.- The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes.- Tree Spanners for Bipartite Graphs and Probe Interval Graphs.- A Simple Linear Time LexBFS Cograph Recognition Algorithm.- Backbone Colorings for Networks.- Greedy Edge-Disjoint Paths in Complete Graphs.- Graph-Based Approaches to Software Watermarking.- Completely Connected Clustered Graphs.- An FPT Algorithm for Set Splitting.- Drawing Planar Graphs on a Curve.- Tree-Partitions of k-Trees with Applications in Graph Layout.- Resource Allocation Problems in Multifiber WDM Tree Networks.- An Improved Upper Bound on the Crossing Number of the Hypercube.- NCE Graph Grammars and Clique-Width.- Chordal Probe Graphs.- Subgraph Induced Planar Connectivity Augmentation.- On the Recognition of General Partition Graphs.- Short Cycles in Planar Graphs.- Complexity of Hypergraph Coloring and Seidel’s Switching.- Feedback Vertex Set and Longest Induced Path on AT-Free Graphs.- The Complexity of Graph Contractions.- Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs.- The Probabilistic Minimum Coloring Problem.- Recognizing Bipolarizable and P 4-Simplicial Graphs.- Coloring Powers of Graphs of Bounded Clique-Width.- Erratum.- Erratum: Cycles in GeneralizedNetworks.