LEADER 05725nam 22007335 450 001 996466146703316 005 20230406065300.0 010 $a3-540-48382-9 024 7 $a10.1007/11917496 035 $a(CKB)1000000000283865 035 $a(SSID)ssj0000317991 035 $a(PQKBManifestationID)11923566 035 $a(PQKBTitleCode)TC0000317991 035 $a(PQKBWorkID)10308705 035 $a(PQKB)11687431 035 $a(DE-He213)978-3-540-48382-3 035 $a(MiAaPQ)EBC3068607 035 $a(PPN)123139473 035 $a(EXLCZ)991000000000283865 100 $a20100301d2006 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] $e32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Papers /$fedited by Fedor V. Fomin 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (XIII, 358 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4271 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-48381-0 320 $aIncludes bibliographical references and index. 327 $aTreewidth: Characterizations, Applications, and Computations -- Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy -- Generalised Dualities and Finite Maximal Antichains -- Chordal Deletion Is Fixed-Parameter Tractable -- A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators -- Divide-and-Color -- Listing Chordal Graphs and Interval Graphs -- A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs -- Improved Edge-Coloring with Three Colors -- Vertex Coloring of Comparability+ke and ?ke Graphs -- Convex Drawings of Graphs with Non-convex Boundary -- How to Sell a Graph: Guidelines for Graph Retailers -- Strip Graphs: Recognition and Scheduling -- Approximating the Traffic Grooming Problem in Tree and Star Networks -- Bounded Arboricity to Determine the Local Structure of Sparse Graphs -- An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time -- Partitioned Probe Comparability Graphs -- Computing Graph Polynomials on Graphs of Bounded Clique-Width -- Generation of Graphs with Bounded Branchwidth -- Minimal Proper Interval Completions -- Monotony Properties of Connected Visible Graph Searching -- Finding Intersection Models of Weakly Chordal Graphs -- A Fully Dynamic Algorithm for the Recognition of P 4-Sparse Graphs -- Clique Graph Recognition Is NP-Complete -- Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms -- Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs -- Graph Labelings Derived from Models in Distributed Computing -- Flexible Matchings -- Simultaneous Graph Embeddings with Fixed Edges -- Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions -- Circular-Perfect Concave-Round Graphs. 330 $aThe 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006) was held on the island of Sotra close to the city of Bergen on the west coast of Norway. The workshop was organized by the Algorithms Research Group at the Department of Informatics, University of Bergen, and it took place from June 22 to June 24. The 78 participants of WG 2006 came from the universities and research institutes of 17 di?erent countries. The WG 2006 workshop continues the series of 31 previous WG workshops. Since 1975,WG has taken place 20 times in Germany, four times in The Neth- lands, twice in Austria as well as oncein France,in Italy, in Slovakia,in Switz- land and in the Czech Republic, and has now been held for the ?rst time in Norway. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer s- ence, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions of future research. The talks showed how recent researchresults from algorithmic graph theory can be used in computer science and which graph-theoreticquestions arisefrom new developments in computer science. There were two fascinating invited lectures by Hans Bodlaender (Utrecht, The Netherlands) and Tandy Warnow (Austin, USA). 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4271 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aArtificial intelligence?Data processing 606 $aComputer graphics 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aData Science 606 $aComputer Graphics 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aArtificial intelligence?Data processing. 615 0$aComputer graphics. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 615 24$aData Science. 615 24$aComputer Graphics. 676 $a005.1 702 $aFomin$b Fedor V$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466146703316 996 $aGraph-Theoretic Concepts in Computer Science$92569248 997 $aUNISA