Overview

This book constitutes the thoroughly refereed proceedings of the 38th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2012) held in Jerusalem, Israel on June 26-28, 2012. The 29 revised full papers presented were carefully selected and reviewed from 78 submissions. The papers are solicited describing original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, randomized, parameterized, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, random graphs, diagram methods, and support of these concepts by suitable implementations. The scope of WG includes all applications of graph-theoretic concepts in Computer Science, including data structures, data bases, programming languages, computational geometry, tools for software construction, communications, computing on the web, models of the web and scale-free networks, mobile computing, concurrency, computer architectures, VLSI, artificial intelligence, graphics, CAD, operations research, and pattern recognition

Full Product Details

Author:   Martin Charles Golumbic ,  Michael Stern ,  Avivit Levy ,  Gila Morgenstern
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Volume:   7551
Dimensions:   Width: 15.50cm , Height: 1.90cm , Length: 23.50cm
Weight:   0.551kg
ISBN:  

9783642346101

ISBN 10:   3642346103
Pages:   346
Publication Date:   11 October 2012
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand  
We will order this item for you from a manufactured on demand supplier.

Table of Contents

Account on Intervals.- Constructing Resilient Structures in Graphs: Rigid vs. Competitive Fault-Tolerance.- Alternating Reachabillity and Integer Sum of Closed Alternating Trails: The 3rd Annual Uri N. Peled Memorial Lecture.- Triangulation and Clique Separator Decomposition of Claw-Free Graphs.- Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs.- Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs.- h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area.- The Duals of Upward Planar Graphs on Cylinders.- On the Minimum Degree Up to Local Complementation: Bounds and Complexity.- Bisections above Tight Lower Bounds.- Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications.- Hydras: Directed Hypergraphs and Horn Formulas.- Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill.- Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs.- Parameterized Domination in Circle Graphs.- On the Parameterized Complexity of Finding Separators with Non-hereditary Properties.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions