Combinatorics and computer science : 8th Franco-Japanese and 4th Franco-Chinese conference, Brest, France, July 3 5, 1995 : selected papers

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 '9...

وصف كامل

محفوظ في:
التفاصيل البيبلوغرافية
مؤلفون مشاركون: Franco-Japanese Conference on Combinatorics and computer science :1995, Franco-Chinese Conference on Combinatorics and computer science (مؤلف)
مؤلفون آخرون: Deza, Michel, 1939-2016 (مدير النشر), Euler, Reinhardt, 1950- (مدير النشر), Manoussakis, Yannis, 1957- (مدير النشر)
التنسيق: Livre numérique
اللغة:Anglais
منشور في: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
سلاسل:Lecture notes in computer science 1120
الموضوعات:
الوصول للمادة أونلاين:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
ملاحظة: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Combinatorics and computer science, 8th Franco-Japanese and 4th Franco-Chinese conference, Brest, France, July 1995, selected papers, M. Deza, R. Euler, I. Manoussakis, 1996, Berlin, Springer, 1 vol. (IX-415 p.), Lecture notes in computer science, 3-540-61576-8
• Combinatorics and Computer Science, Texte imprimé, 9783662186503
LEADER 05475nam a22004817a 4500
001 943991
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155170740
020 |a 9783540706274 (PDF) 
041 0 |a eng 
082 |a 004.015116 
082 |a 004 
111 2 |a Franco-Japanese Conference on Combinatorics and computer science  |n (08  |c  :1995)  |d (Brest. 
245 1 0 |a Combinatorics and computer science :  |b 8th Franco-Japanese and 4th Franco-Chinese conference, Brest, France, July 3 5, 1995 : selected papers   |c [edited by] Michel Deza, Reinhardt Euler, Ioannis Manoussakis. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 1120  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a 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. 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
520 |a 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. 
650 |a Informatique 
650 |a Théorie des graphes 
650 |a Optimisation combinatoire 
650 |a Ordinateurs 
650 |a Réseaux d'ordinateurs 
650 |a Analyse numérique 
650 |a Analyse combinatoire 
650 |a Actes de congrès 
700 1 |a Deza, Michel,  |d 1939-2016.  |4 pbd 
700 1 |a Euler, Reinhardt,  |d 1950-  |4 pbd 
700 1 |a Manoussakis, Yannis,  |d 1957-  |4 pbd 
711 2 |a Franco-Chinese Conference on Combinatorics and computer science  |n (04  |c  :1995)  |d (Brest.  |4 aut 
776 0 |0 025925067  |t Combinatorics and computer science  |o 8th Franco-Japanese and 4th Franco-Chinese conference, Brest, France, July 1995  |o selected papers  |f M. Deza, R. Euler, I. Manoussakis  |d 1996  |c Berlin  |n Springer  |p 1 vol. (IX-415 p.)  |s Lecture notes in computer science  |z 3-540-61576-8 
776 0 |t Combinatorics and Computer Science  |b Texte imprimé  |z 9783662186503 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-61576-8  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-SXLVP7Q7-C  |z Accès sur la plateforme Istex 
856 4 |5 452349901:747923760  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-61576-8  |z Accès Université d'Orléans 
856 4 |5 180339901:750936029  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-61576-8  |z Accès INSA CVL 
997 |0 943991  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/