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ț: 571^.63 lei
20%

Preț: 336^.71 lei
20%

Preț: 333^.46 lei
20%

Preț: 662^.76 lei
20%

Preț: 330^.23 lei
20%

Preț: 747^.79 lei
20%

Preț: 438^.67 lei
20%

Preț: 369^.12 lei
20%

Preț: 315^.76 lei
20%

Preț: 584^.40 lei
20%

Preț: 148^.66 lei
20%

Preț: 122^.89 lei
20%

Preț: 315^.18 lei
20%

Preț: 256^.26 lei
20%

Preț: 1040^.03 lei
20%

Preț: 504^.56 lei
Preț: 402^.62 lei
20%

Preț: 346^.40 lei
20%

Preț: 301^.94 lei
20%

Preț: 237^.99 lei
5%

Preț: 365^.59 lei
20%

Preț: 309^.89 lei
20%

Preț: 321^.95 lei
20%

Preț: 310^.25 lei
20%

Preț: 334^.68 lei
Preț: 373^.56 lei
20%

Preț: 172^.68 lei
20%

Preț: 1386^.07 lei
20%

Preț: 315^.76 lei
20%

Preț: 1003^.66 lei
20%

Preț: 444^.17 lei
20%

Preț: 567^.60 lei
20%

Preț: 632^.22 lei
17%

Preț: 360^.18 lei
20%

Preț: 538^.28 lei
20%

Preț: 335^.08 lei
20%

Preț: 307^.68 lei
20%

Preț: 343^.16 lei
20%

Preț: 641^.78 lei
20%

Preț: 579^.56 lei
20%

Preț: 1053^.45 lei
15%

Preț: 568^.74 lei
Preț: 389^.47 lei
20%

Preț: 333^.46 lei
20%

Preț: 607^.38 lei
20%

Preț: 326^.97 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.