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...
Enregistré dans:
| Collectivités auteurs: | , |
|---|---|
| Andre forfattere: | , , |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
1120 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
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 |
Indholdsfortegnelse:
- 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.