Combinatorics and Computer Science: 8th Franco-Japanese and 4th Franco-Chinese Conference, Brest, France, July 3 - 5, 1995 Selected PapersThis 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. |
Contents
I | 1 |
II | 6 |
III | 18 |
IV | 27 |
V | 39 |
VI | 48 |
VII | 53 |
VIII | 58 |
XXI | 208 |
XXII | 218 |
XXIII | 234 |
XXIV | 244 |
XXV | 263 |
XXVI | 275 |
XXVII | 288 |
XXVIII | 301 |
IX | 67 |
X | 74 |
XI | 91 |
XII | 112 |
XIII | 129 |
XV | 150 |
XVIII | 163 |
XIX | 182 |
XX | 194 |
XXIX | 316 |
XXX | 328 |
XXXI | 341 |
XXXII | 348 |
XXXIII | 367 |
XXXIV | 378 |
XXXV | 396 |
XXXVI | 406 |
Other editions - View all
Combinatorics and Computer Science Michel M. Deza,Reinhardt Euler,Ioannis Manoussakis No preview available - 2014 |
Common terms and phrases
adjacent algorithm alternating factor array assignment bipartite graph cmax combinatorial complete bipartite complete graph component Computer cone connected consider constraints construct contains corresponding cyclic decomposition defined Definition denote digraph discrete system distance-hereditary graph edge coloring exists extreme rays facets Figure FPGA function given graph G greedy algorithm Hamiltonian Hamiltonian cycle Hamiltonian path heuristic hypergraph Imax independent set integer interval graph iteration l₁-graphs Lemma linear lower bound M₁ mapping matching Math matrix matroid maximal maximum method metric minimal minimum edge coloring NP-complete obtained optimal parallel path permutations planar polynomial polytope prefix problem processors Proof Proposition PV chunk queue Ramsey numbers resp respectively scheduling semaphore sequence solution solve split graph subgraph subset suffix t₁ t₂ task intervals Theorem threshold graphs tournament vector vertex vertex set vertices wedge property weight z-factorization z-free hulls z-submonoid