Description: Graph-Theoretic Concepts in Computer Science by Martin Charles Golumbic, Michael Stern, Avivit Levy, Gila Morgenstern 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. FORMAT Paperback LANGUAGE English CONDITION Brand New Publisher Description 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 Back Cover 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 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. Feature Fast conference proceedings State-of-the-art report Up to date results Details ISBN3642346103 Edition Description 2012 Language English ISBN-10 3642346103 ISBN-13 9783642346101 Media Book Format Paperback Series Number 7551 Edition 12201st Subtitle 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers Pages 346 Short Title GRAPH THEORETIC CONCEPTS IN CO Year 2012 Publication Date 2012-10-11 Imprint Springer-Verlag Berlin and Heidelberg GmbH & Co. K Place of Publication Berlin Country of Publication Germany Edited by Gila Morgenstern DOI 10.1007/978-3-642-34611-8 Author Gila Morgenstern Publisher Springer-Verlag Berlin and Heidelberg GmbH & Co. KG DEWEY 004.015115 Illustrations 45 Illustrations, black and white; XIV, 346 p. 45 illus. Audience Professional & Vocational Series Lecture Notes in Computer Science We've got this At The Nile, if you're looking for it, we've got it. With fast shipping, low prices, friendly service and well over a million items - you're bound to find what you want, at a price you'll love! TheNile_Item_ID:96266204;
Price: 116.58 AUD
Location: Melbourne
End Time: 2025-01-05T06:33:49.000Z
Shipping Cost: 11.25 AUD
Product Images
Item Specifics
Restocking fee: No
Return shipping will be paid by: Buyer
Returns Accepted: Returns Accepted
Item must be returned within: 30 Days
ISBN-13: 9783642346101
Book Title: Graph-Theoretic Concepts in Computer Science
Number of Pages: 346 Pages
Language: English
Publication Name: Graph-Theoretic Concepts in Computer Science: 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Publication Year: 2012
Subject: Computer Science, Mathematics
Item Height: 235 mm
Item Weight: 551 g
Type: Textbook
Author: Martin Charles Golumbic, Gila Morgenstern, Avivit Levy, Michael Stern
Item Width: 155 mm
Format: Paperback
