LEADER 05242nam 22007095 450 001 996465754403316 005 20200630150747.0 010 $a3-540-69643-1 024 7 $a10.1007/BFb0024481 035 $a(CKB)1000000000234755 035 $a(SSID)ssj0000323630 035 $a(PQKBManifestationID)11242478 035 $a(PQKBTitleCode)TC0000323630 035 $a(PQKBWorkID)10301071 035 $a(PQKB)10712766 035 $a(DE-He213)978-3-540-69643-8 035 $a(PPN)15517407X 035 $a(EXLCZ)991000000000234755 100 $a20121227d1997 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] $e23rd International Workshop, WG'97, Berlin, Germany, June 18-20, 1997. Proceedings /$fedited by Rolf H. Möhring 205 $a1st ed. 1997. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1997. 215 $a1 online resource (X, 382 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1335 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-63757-5 327 $aGadgets, approximation, and linear programming: Improved hardness results for cut and satisfiability problems -- Non-oblivious local search for MAX 2-CCSP with application to MAX DICUT -- On the number of simple cycles in planar graphs -- On the separable-homogeneous decomposition of graphs -- Pseudo-hamiltonian graphs -- Acyclic orientations for deadlock prevention in interconnection networks -- Weak-order extensions of an order -- An upper bound for the maximum cut mean value -- NP-completeness results for minimum planar spanners -- Computing the independence number of dense triangle-free graphs -- Algorithms for the treewidth and minimum fill-in of HHD-free graphs -- Block decomposition of inheritance hierarchies -- Minimal elimination ordering inside a given chordal graph -- On-line algorithms for networks of temporal constraints -- Parallel algorithms for treewidth two -- On optimal graphs embedded into paths and rings, with analysis using l 1-spheres -- On greedy matching ordering and greedy matchable graphs -- Off-line and on-line call-scheduling in stars and trees -- Computational complexity of the Krausz dimension of graphs -- Asteroidal sets in graphs -- Complexity of colored graph covers I. Colored directed multigraphs -- A syntactic approach to random walks on graphs -- Bicliques in graphs II: Recognizing k-path graphs and underlying graphs of line digraphs -- Large networks with small diameter -- The bounded tree-width problem of context-free graph languages -- Structured programs have small tree-width and good register allocation -- A measure of parallelization for the lexicographically first maximal subgraph problems -- Make your enemies transparent -- Optimal fault-tolerant ATM-routings for biconnected graphs. 330 $aThis book constitutes the strictly refereed post-workshop proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG'97, held in Berlin, Germany in June 1997. The volume presents 28 revised full papers carefully selected for inclusion in the book from 42 submissions. The papers address a variety of graph-theoretic issues relevant from the computer science point of view such as graph algorithms, cycles, graph decompositions, interconnection networks, local search, graph orderings, graph matching, graph languages, tree-width computation, etc. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1335 606 $aComputers 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aData structures (Computer science) 606 $aCombinatorics 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 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 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 615 0$aComputers. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aData structures (Computer science). 615 0$aCombinatorics. 615 14$aTheory of Computation. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputation by Abstract Devices. 615 24$aData Structures. 615 24$aCombinatorics. 676 $a004.0151 702 $aMöhring$b Rolf H$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465754403316 996 $aGraph-Theoretic Concepts in Computer Science$9772292 997 $aUNISA