LEADER 00976nam0-2200325---450 001 990008562170403321 005 20240320152929.0 010 $a88-7802-158-X 035 $aFED01000856217 035 $a(Aleph)000856217FED01 035 $a000856217 100 $a20071010d1990----km-y0itay50------ba 101 0 $aita 102 $aIT 105 $ay-------001yy 200 1 $aFilosofia, storia, istituzioni$esaggi e conferenze$fLivio Sichirollo 210 $aMilano$cGuerini e associati$d1990 215 $a378 p.$d21 cm 225 1 $aSaggi$fIstituto italiano per gli studi filosofici$v8 610 0 $aFilosofia$aStoria 676 $a109$v21$zita 700 1$aSichirollo,$bLivio$f<1928-2002>$032787 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990008562170403321 952 $aP.1 SF 469$bBibl. 10120$fFLFBC 952 $aDAM A05 SICL 01$b2024/3313$fFLFBC 959 $aFLFBC 996 $aFilosofia, storia, istituzioni$9708641 997 $aUNINA LEADER 07413nam 22007815 450 001 9910483967503321 005 20240607121220.0 010 $a3-540-30559-9 024 7 $a10.1007/b104584 035 $a(CKB)1000000000212674 035 $a(SSID)ssj0000165117 035 $a(PQKBManifestationID)11162858 035 $a(PQKBTitleCode)TC0000165117 035 $a(PQKBWorkID)10125785 035 $a(PQKB)10371982 035 $a(DE-He213)978-3-540-30559-0 035 $a(MiAaPQ)EBC3068303 035 $a(PPN)134123700 035 $a(EXLCZ)991000000000212674 100 $a20100702d2005 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aGraph-Theoretic Concepts in Computer Science $e30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers /$fedited by Juraj Hromkovi?, Manfred Nagl, Bernhard Westfechtel 205 $a1st ed. 2005. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005. 215 $a1 online resource (XI, 404 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v3353 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-24132-9 320 $aIncludes bibliographical references and index. 327 $aInvited Papers -- Lexicographic Breadth First Search ? A Survey -- Wireless Networking: Graph Theory Unplugged -- Graph Algorithms: Trees -- Constant Time Generation of Trees with Specified Diameter -- Treelike Comparability Graphs: Characterization, Recognition, and Applications -- Elegant Distance Constrained Labelings of Trees -- Collective Tree Spanners and Routing in AT-free Related Graphs -- Graph Algorithms: Recognition and Decomposition -- On the Maximum Cardinality Search Lower Bound for Treewidth -- Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs -- Recognizing HHD-free and Welsh-Powell Opposition Graphs -- Bimodular Decomposition of Bipartite Graphs -- Coloring a Graph Using Split Decomposition -- Graph Algorithms: Various Problems -- Decremental Clique Problem -- A Symbolic Approach to the All-Pairs Shortest-Paths Problem -- Minimal de Bruijn Sequence in a Language with Forbidden Substrings -- A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic -- Optimization and Approximation Algorithms -- The Computational Complexity of the Minimum Weight Processor Assignment Problem -- A Stochastic Location Problem with Applications to Tele-diagnostic -- A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs -- Tolerance Based Algorithms for the ATSP -- Parameterized Complexity and Exponential Algorithms -- Finding k Disjoint Triangles in an Arbitrary Graph -- Exact (Exponential) Algorithms for the Dominating Set Problem -- Linear Kernels in Linear Time, or How to Save k Colors in O(n 2) Steps -- Counting, Combinatorics, and Optimization -- Planar Graphs, via Well-Orderly Maps and Trees -- Efficient Computation of the Lovász Theta Function for a Class of Circulant Graphs -- Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters -- Applications (Biology, Graph Drawing) -- Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs -- Octagonal Drawings of Plane Graphs with Prescribed Face Areas -- Crossing Reduction in Circular Layouts -- Graph Classes and NP Hardness -- Characterization and Recognition of Generalized Clique-Helly Graphs -- Edge-Connectivity Augmentation and Network Matrices -- Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size -- The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small -- Core Stability of Minimum Coloring Games. 330 $aDuring its 30-year existence, the International Workshop on Graph-Theoretic Concepts in Computer Science has become a distinguished and high-quality computer science event. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can successfully be applied to v- ious areas of computer science and by exposing new theories emerging from applications. In this way, WG provides a common ground for the exchange of information among people dealing with several graph problems and working in various disciplines. Thereby, the workshop contributes to forming an interdis- plinary research community. The original idea of the Workshop on Graph-Theoretic Concepts in C- puter Science was ingenuity in all theoretical aspects and applications of graph concepts, wherever applied. Within the last ten years, the development has strengthened in particular the topic of structural graph properties in relation to computational complexity. This workshop has become pivotal for the c- munity interested in these areas.An aimspeci?c to the 30thWG was to support the central role of WG in both of the prementioned areas on the one hand and on the other hand to promote its originally broader scope. The 30th WG was held at the Physikzentrum Bad Honnef, which serves as the main meeting point of the German Physical Society. It o?ers a secluded setting for research conferences, seminars, and workshops, and has proved to be especiallystimulatingforfruitful discussions.Talksweregiveninthenewlecture hall with a modern double rear projection, interactive electronic board, and full video conferencing equipment. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v3353 606 $aComputers 606 $aComputer simulation 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aNumerical analysis 606 $aData structures (Computer science) 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aSimulation and Modeling$3https://scigraph.springernature.com/ontologies/product-market-codes/I19000 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aNumeric Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I1701X 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 615 0$aComputers. 615 0$aComputer simulation. 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aNumerical analysis. 615 0$aData structures (Computer science). 615 14$aTheory of Computation. 615 24$aSimulation and Modeling. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumeric Computing. 615 24$aData Structures. 676 $a004.0151 702 $aHromkovi?$b Juraj$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aNagl$b Manfred$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aWestfechtel$b Bernhard$f1958-$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a9910483967503321 996 $aGraph-Theoretic Concepts in Computer Science$92569248 997 $aUNINA