05103nam 22007575 450 99646527530331620230330003849.03-642-34611-110.1007/978-3-642-34611-8(CKB)3280000000002217(SSID)ssj0000788961(PQKBManifestationID)11518567(PQKBTitleCode)TC0000788961(PQKBWorkID)10723423(PQKB)11628647(DE-He213)978-3-642-34611-8(MiAaPQ)EBC3069874(PPN)168327244(EXLCZ)99328000000000221720121026d2012 u| 0engurnn#008mamaatxtccrGraph-Theoretic Concepts in Computer Science[electronic resource] 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers /edited by Martin Charles Golumbic, Michael Stern, Avivit Levy, Gila Morgenstern1st ed. 2012.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2012.1 online resource (XIV, 346 p. 45 illus.)Theoretical Computer Science and General Issues,2512-2029 ;7551Bibliographic Level Mode of Issuance: Monograph3-642-34610-3 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.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.Theoretical Computer Science and General Issues,2512-2029 ;7551Computer science—MathematicsDiscrete mathematicsArtificial intelligenceAlgorithmsArtificial intelligence—Data processingGeometryDiscrete Mathematics in Computer ScienceArtificial IntelligenceAlgorithmsData ScienceGeometryComputer science—Mathematics.Discrete mathematics.Artificial intelligence.Algorithms.Artificial intelligence—Data processing.Geometry.Discrete Mathematics in Computer Science.Artificial Intelligence.Algorithms.Data Science.Geometry.004.0151Golumbic Martin Charlesedthttp://id.loc.gov/vocabulary/relators/edtStern Michaeledthttp://id.loc.gov/vocabulary/relators/edtLevy Avivitedthttp://id.loc.gov/vocabulary/relators/edtMorgenstern Gilaedthttp://id.loc.gov/vocabulary/relators/edtBOOK996465275303316Graph-Theoretic Concepts in Computer Science2569248UNISA