LEADER 05792nam 22007575 450 001 996465630703316 005 20200704235215.0 010 $a3-540-70627-5 024 7 $a10.1007/3-540-61576-8 035 $a(CKB)1000000000234500 035 $a(SSID)ssj0000321926 035 $a(PQKBManifestationID)11937841 035 $a(PQKBTitleCode)TC0000321926 035 $a(PQKBWorkID)10280098 035 $a(PQKB)11643576 035 $a(DE-He213)978-3-540-70627-4 035 $a(PPN)155170740 035 $a(EXLCZ)991000000000234500 100 $a20121227d1996 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorics and Computer Science$b[electronic resource] $e8th Franco-Japanese and 4th Franco-Chinese Conference, Brest, France, July 3 - 5, 1995 Selected Papers /$fedited by Michel M. Deza, Reinhardt Euler, Ioannis Manoussakis 205 $a1st ed. 1996. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1996. 215 $a1 online resource (X, 426 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1120 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-61576-8 327 $aEquitable and m-bounded coloring of split graphs -- Four coloring for a subset of maximal planar graphs with minimum degree five -- Enumeration algorithm for the edge coloring problem on bipartite graphs -- On-line recognition of interval graphs in O(m+nlog n) time -- Connected proper interval graphs and the guard problem in spiral polygons -- Weighted connected domination and Steiner trees in distance-hereditary graphs -- On central spanning trees of a graph -- Complete bipartite decompositions of crowns, with applications to complete directed graphs -- Finding an antidirected Hamiltonian path starting with a forward arc from a given vertex of a tournament -- Complementary ?1-graphs and related combinatorial structures -- Double description method revisited -- On skeletons, diameters and volumes of metric polyhedra -- Improving branch and bound for Jobshop scheduling with constraint propagation -- A new efficiently solvable special case of the three-dimensional axial bottleneck assignment problem -- Ramsey numbers by stochastic algorithms with new heuristics -- On the hybrid neural network model for solving optimization problems -- Constructive ? non-constructive approximation and maximum independent set problem -- Weakly greedy algorithm and pair-delta-matroids -- On integer multiflows and metric packings in matroids -- Optimum alphabetic binary trees -- Block codes for dyadic phase shift keying -- Zigzag codes and z-free hulls -- Contiguity orders -- Worst-case analysis for on-line data compression -- Gossiping in cayley graphs by packets -- On embedding 2-dimensional toroidal grids into de Bruijn graphs with clocked congestion one -- N-cube string matching algorithm with long texts -- Combinatorics for multiprocessor scheduling optimization and other contexts in computer architecture -- Some applications of combinatorial optimization in parallel computing -- On the parallel complexity of the alternating Hamiltonian cycle problem -- Threshold graphs and synchronization protocols -- Task assignment in distributed systems using network flow methods -- Distributed rerouting in DCS mesh networks. 330 $aThis book presents a collection of 33 strictly refereed full papers on combinatorics and computer science; these papers have been selected from the 54 papers accepted for presentation at the joint 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics in Computer Science, CCS '96, held in Brest, France in July 1995. The papers included in the book have been contributed by authors from 10 countries; they are organized in sections entitled graph theory, combinatorial optimization, selected topics, and parallel and distributed computing. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1120 606 $aDiscrete mathematics 606 $aComputers 606 $aComputer communication systems 606 $aCombinatorics 606 $aNumerical analysis 606 $aComputer programming 606 $aDiscrete Mathematics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29000 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 606 $aNumerical Analysis$3https://scigraph.springernature.com/ontologies/product-market-codes/M14050 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 615 0$aDiscrete mathematics. 615 0$aComputers. 615 0$aComputer communication systems. 615 0$aCombinatorics. 615 0$aNumerical analysis. 615 0$aComputer programming. 615 14$aDiscrete Mathematics. 615 24$aTheory of Computation. 615 24$aComputer Communication Networks. 615 24$aCombinatorics. 615 24$aNumerical Analysis. 615 24$aProgramming Techniques. 676 $a004/.01/5116 702 $aDeza$b Michel M$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aEuler$b Reinhardt$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aManoussakis$b Ioannis$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465630703316 996 $aCombinatorics and computer science$91501974 997 $aUNISA LEADER 01282nam 2200325Ia 450 001 996388072003316 005 20221108044950.0 035 $a(CKB)1000000000624146 035 $a(EEBO)2240958643 035 $a(OCoLC)12789394 035 $a(EXLCZ)991000000000624146 100 $a19851113d1700 uy | 101 0 $aeng 135 $aurbn#|||a|bb| 200 00$aMr. George Keiths reasons for renouncing Quakerism, and entering into communion with the Church of England$b[electronic resource] $ewith other remarkable occurrences that will be acceptable to all orthodox Christians, of every persuasion 210 $aLondon $cPrinted, and are to be sold by the booksellers of London and Westminster$d1700 215 $a38 p 300 $aImperfect: pages stained with loss of print. 300 $aReproduction of original in the Huntington Library. 330 $aeebo-0113 606 $aSociety of Friends$vControversial literature 615 0$aSociety of Friends 701 $aKeith$b George$f1639?-1716.$01000958 801 0$bEAF 801 1$bEAF 801 2$bWaOLN 906 $aBOOK 912 $a996388072003316 996 $aMr. George Keiths reasons for renouncing Quakerism, and entering into communion with the Church of England$92311549 997 $aUNISA