Graph-Theoretic Concepts in Computer Science 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Bodlaender, Hans L. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
• Έκδοση: 1st ed. 2003.
• Σειρά: Lecture Notes in Computer Science, 2880
• Θέματα: Computers.; Computer simulation.; Algorithms.; Data structures (Computer science).; Numerical analysis.; Computer science-Mathematics.; Theory of Computation.; Simulation and Modeling.; Algorithm Analysis and Problem Complexity.; Data Structures.; Numeric Computing.; Discrete Mathematics in Computer Science.

The 29th International Workshop on Graph-Theoretic Concepts in Computer Science(WG2003)washeldintheMennorodeconferenceCenterinElspeet,The Netherlands.TheworkshopwasorganizedbytheCenterforAlgorithmicSystems of the Institute of Information and Computing Sciences of Utrecht University. The workshop too...

Πίνακας περιεχομένων:

• 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 Generalized Networks.