Back to Search

Graph-Theoretic Concepts in Computer Science: 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers

PUBLISHER Springer (10/11/2012)
PRODUCT TYPE Paperback (Paperback)
Description

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.
Show More
Product Format
Product Details
ISBN-13: 9783642346101
ISBN-10: 3642346103
Binding: Paperback or Softback (Trade Paperback (Us))
Content Language: English
More Product Details
Page Count: 346
Carton Quantity: 24
Product Dimensions: 6.10 x 0.70 x 9.00 inches
Weight: 1.10 pound(s)
Feature Codes: Bibliography, Index, Table of Contents, Illustrated
Country of Origin: NL
Subject Information
BISAC Categories
Computers | Artificial Intelligence - General
Computers | Geometry - General
Computers | Programming - Algorithms
Dewey Decimal: 511.5
Descriptions, Reviews, Etc.
jacket back
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
Show More
publisher marketing

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.

Show More
Editor: Golumbic, Martin Charles
Martin Charles Golumbic is Professor of Computer Science and Director of the Caesarea Edmond Benjamin de Rothschild Foundation Institute for Interdisciplinary Applications of Computer Science at the University of Haifa. He is the editor of the book "Advances in Artificial Intelligence, Natural Language and Knowledge-based Systems" (Springer, 1990), the author of the book "Algorithmic Graph Theory and Perfect Graphs" (second edition, Elsevier 2004), coauthor of a second book "Tolerance Graphs" (Cambridge University Press, 2004), and the founding editor-in-chief of the journal series "Annals of Mathematics and Artificial Intelligence" (Springer). Professor Golumbic received his Ph.D. in mathematics from Columbia University in 1975, and has previously held positions at New York University, Bell Laboratories, IBM Israel and Bar-Ilan University as well as visiting positions at UniversitA(c) de Paris, the Weizmann Institute of Science, and Ecole Polytechnique FA(c)dA(c)rale de Lausanne. He has given guest lectures in 15 states in the U.S.A. and in 20 other countries, and he was elected as a Fellow of the European Artificial Intelligence society ECCAI in 2005.
Show More
Editor: Stern, Michael
Michael is fascinated by food, travel and culture, and after 30 years, 29 cars, and 3 million miles, they have become America's foremost experts on regional food. They have published more than 30 books on popular culture, including Roadfood Cookbooks on the Blue Willow Inn, El Charro Cafe, Durgin-Park, Louie's Backyard, and Harry Caray's Restaurant. They are columnists for Gourmet and frequent contributors to Sky. They have a weekly feature on NPR's The Splendid Table.
Show More
List Price $54.99
Your Price  $54.44
Paperback