05792nam 22007575 450 99646563070331620200704235215.03-540-70627-510.1007/3-540-61576-8(CKB)1000000000234500(SSID)ssj0000321926(PQKBManifestationID)11937841(PQKBTitleCode)TC0000321926(PQKBWorkID)10280098(PQKB)11643576(DE-He213)978-3-540-70627-4(PPN)155170740(EXLCZ)99100000000023450020121227d1996 u| 0engurnn|008mamaatxtccrCombinatorics and Computer Science[electronic resource] 8th Franco-Japanese and 4th Franco-Chinese Conference, Brest, France, July 3 - 5, 1995 Selected Papers /edited by Michel M. Deza, Reinhardt Euler, Ioannis Manoussakis1st ed. 1996.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1996.1 online resource (X, 426 p.) Lecture Notes in Computer Science,0302-9743 ;1120Bibliographic Level Mode of Issuance: Monograph3-540-61576-8 Equitable 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.This 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.Lecture Notes in Computer Science,0302-9743 ;1120Discrete mathematicsComputersComputer communication systemsCombinatoricsNumerical analysisComputer programmingDiscrete Mathematicshttps://scigraph.springernature.com/ontologies/product-market-codes/M29000Theory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Computer Communication Networkshttps://scigraph.springernature.com/ontologies/product-market-codes/I13022Combinatoricshttps://scigraph.springernature.com/ontologies/product-market-codes/M29010Numerical Analysishttps://scigraph.springernature.com/ontologies/product-market-codes/M14050Programming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Discrete mathematics.Computers.Computer communication systems.Combinatorics.Numerical analysis.Computer programming.Discrete Mathematics.Theory of Computation.Computer Communication Networks.Combinatorics.Numerical Analysis.Programming Techniques.004/.01/5116Deza Michel Medthttp://id.loc.gov/vocabulary/relators/edtEuler Reinhardtedthttp://id.loc.gov/vocabulary/relators/edtManoussakis Ioannisedthttp://id.loc.gov/vocabulary/relators/edtBOOK996465630703316Combinatorics and computer science1501974UNISA