Combinatorics and Computer Science de Michel M. Deza

Combinatorics and Computer Science: 8th Franco-Japanese and 4th Franco-Chinese Conference, Brest, France, July 3 - 5, 1995 Selected Papers: Lecture Notes in Computer Science, cartea 1120

Michel M. Deza

Reinhardt Euler

Ioannis Manoussakis

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.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

20%

Preț: 323^.14 lei
20%

Preț: 461^.32 lei
20%

Preț: 460^.98 lei
20%

Preț: 390^.41 lei
20%

Preț: 526^.98 lei
15%

Preț: 388^.21 lei
20%

Preț: 461^.21 lei
20%

Preț: 390^.08 lei
20%

Preț: 496^.30 lei
20%

Preț: 461^.21 lei
20%

Preț: 389^.45 lei
15%

Preț: 461^.53 lei
20%

Preț: 389^.63 lei
20%

Preț: 496^.68 lei
20%

Preț: 461^.70 lei
20%

Preț: 251^.97 lei
20%

Preț: 390^.86 lei
20%

Preț: 532^.16 lei
20%

Preț: 461^.52 lei
20%

Preț: 255^.72 lei
20%

Preț: 498^.10 lei
20%

Preț: 497^.19 lei
20%

Preț: 499^.02 lei
20%

Preț: 389^.82 lei
20%

Preț: 390^.92 lei
20%

Preț: 390^.86 lei
20%

Preț: 390^.92 lei
20%

Preț: 390^.08 lei
20%

Preț: 461^.45 lei
20%

Preț: 392^.36 lei
20%

Preț: 460^.75 lei
20%

Preț: 461^.32 lei
20%

Preț: 389^.90 lei
20%

Preț: 639^.26 lei
20%

Preț: 390^.66 lei
20%

Preț: 391^.57 lei
20%

Preț: 389^.57 lei
20%

Preț: 497^.97 lei
20%

Preț: 462^.36 lei
20%

Preț: 460^.67 lei
20%

Preț: 423^.95 lei
5%

Preț: 515^.91 lei
15%

Preț: 535^.55 lei
20%

Preț: 531^.90 lei
20%

Preț: 403^.00 lei
20%

Preț: 535^.41 lei
20%

Preț: 461^.25 lei
20%

Preț: 498^.17 lei
20%

Preț: 461^.52 lei
20%

Preț: 249^.77 lei

Cuprins

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.