LEADER 05103nam 22007575 450 001 996465275303316 005 20230330003849.0 010 $a3-642-34611-1 024 7 $a10.1007/978-3-642-34611-8 035 $a(CKB)3280000000002217 035 $a(SSID)ssj0000788961 035 $a(PQKBManifestationID)11518567 035 $a(PQKBTitleCode)TC0000788961 035 $a(PQKBWorkID)10723423 035 $a(PQKB)11628647 035 $a(DE-He213)978-3-642-34611-8 035 $a(MiAaPQ)EBC3069874 035 $a(PPN)168327244 035 $a(EXLCZ)993280000000002217 100 $a20121026d2012 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aGraph-Theoretic Concepts in Computer Science$b[electronic resource] $e38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers /$fedited by Martin Charles Golumbic, Michael Stern, Avivit Levy, Gila Morgenstern 205 $a1st ed. 2012. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2012. 215 $a1 online resource (XIV, 346 p. 45 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7551 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-34610-3 327 $aAccount 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. 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7551 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence 606 $aAlgorithms 606 $aArtificial intelligence?Data processing 606 $aGeometry 606 $aDiscrete Mathematics in Computer Science 606 $aArtificial Intelligence 606 $aAlgorithms 606 $aData Science 606 $aGeometry 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence. 615 0$aAlgorithms. 615 0$aArtificial intelligence?Data processing. 615 0$aGeometry. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aArtificial Intelligence. 615 24$aAlgorithms. 615 24$aData Science. 615 24$aGeometry. 676 $a004.0151 702 $aGolumbic$b Martin Charles$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aStern$b Michael$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLevy$b Avivit$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMorgenstern$b Gila$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465275303316 996 $aGraph-Theoretic Concepts in Computer Science$92569248 997 $aUNISA