LEADER 05693nam 22007455 450 001 996466261003316 005 20200630021211.0 010 $a3-540-48385-3 024 7 $a10.1007/3-540-57899-4 035 $a(CKB)1000000000234099 035 $a(SSID)ssj0000323614 035 $a(PQKBManifestationID)11247884 035 $a(PQKBTitleCode)TC0000323614 035 $a(PQKBWorkID)10300455 035 $a(PQKB)10957344 035 $a(DE-He213)978-3-540-48385-4 035 $a(PPN)155193481 035 $a(EXLCZ)991000000000234099 100 $a20121227d1994 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] $e19th International Workshop, WG '93, Utrecht, The Netherlands, June 16 - 18, 1993. Proceedings /$fedited by Jan van Leeuwen 205 $a1st ed. 1994. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1994. 215 $a1 online resource (XI, 437 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v790 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-57899-4 327 $aNear-optimal dominating sets in dense random graphs in polynomial expected time -- Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequality -- Hierarchically specified unit disk graphs -- Bounded tree-width and LOGCFL -- On reduction algorithms for graphs with small treewidth -- Algorithms and complexity of sandwich problems in graphs (extended abstract) -- On-line graph algorithms for incremental compilation -- Average case analysis of fully dynamic connectivity for directed graphs -- Fully dynamic maintenance of vertex cover -- Dynamic algorithms for graphs with treewidth 2 -- Short disjoint cycles in graphs with degree constraints -- Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs -- Towards a solution of the Holyer's problem -- Graphs, hypergraphs and hashing -- Coloring k-colorable graphs in constant expected parallel time -- Deciding 3-colourability in less than O(1.415n) steps -- A rainbow about T-colorings for complete graphs -- Approximating the chromatic polynomial of a graph -- Asteroidal triple-free graphs -- The parallel complexity of elimination ordering procedures -- Dually chordal graphs -- The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions -- Regular marked Petri nets -- The asynchronous committee meeting problem -- Gossiping in vertex-disjoint paths mode in interconnection networks -- The folded Petersen network: A new versatile multiprocessor interconnection topology -- Fast load balancing in Cayley graphs and in circuits -- Concurrent flows and packet routing in Cayley graphs (Preliminary version) -- On multi-label linear interval routing schemes -- An ?All pairs shortest paths? distributed algorithm using 2n 2 messages -- Linear layouts of generalized hypercubes -- Graph ear decompositions and graph embeddings -- Improved bounds for the crossing numbers on surfaces of genus g -- Two algorithms for finding rectangular duals of planar graphs -- A more compact visibility representation. 330 $aThis volume contains the proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science, WG '93, held near Utrecht, The Netherlands, in 1993. The papers are grouped into parts on: hard problems on classes of graphs, structural graph theory, dynamic graph algorithms, structure-oriented graph algorithms, graph coloring, AT-free and chordal graphs, circuits and nets, graphs and interconnection networks, routing and shortest paths, and graph embedding and layout. The 35 revised papers were chosen from 92 submissions after a careful refereeing process. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v790 606 $aComputers 606 $aDiscrete mathematics 606 $aApplication software 606 $aAlgorithms 606 $aCombinatorics 606 $aComputer logic 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aDiscrete Mathematics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29000 606 $aComputer Applications$3https://scigraph.springernature.com/ontologies/product-market-codes/I23001 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 615 0$aComputers. 615 0$aDiscrete mathematics. 615 0$aApplication software. 615 0$aAlgorithms. 615 0$aCombinatorics. 615 0$aComputer logic. 615 14$aTheory of Computation. 615 24$aDiscrete Mathematics. 615 24$aComputer Applications. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aCombinatorics. 615 24$aLogics and Meanings of Programs. 676 $a004/.01/5115 702 $aLeeuwen$b Jan van$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Workshop on Graph-Theoretic Concepts in Computer Science$d(19th :$f1993 :$eUtrecht, Netherlands) 906 $aBOOK 912 $a996466261003316 996 $aGraph-Theoretic Concepts in Computer Science$9772292 997 $aUNISA