Combinatorics and Computer Science - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

33

(FIVE YEARS 0)

H-INDEX

6

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540615767, 9783540706274

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Gossiping in cayley graphs by packets

Combinatorics and Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-61576-8_91 ◽

1996 ◽

pp. 301-315 ◽

Author(s):

Jean-Claude Bermond ◽

Takako Kodate ◽

Stéphane Pérennes

Keyword(s):

Download Full-text

Zigzag codes and z-free hulls

Combinatorics and Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-61576-8_88 ◽

1996 ◽

pp. 263-274

Author(s):

Bruno Patrou

Keyword(s):

Download Full-text

On the hybrid neural network model for solving optimization problems

Combinatorics and Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-61576-8_82 ◽

1996 ◽

pp. 182-193

Author(s):

Fouad B. Chedid

Keyword(s):

Neural Network ◽

Network Model ◽

Neural Network Model ◽

Optimization Problems ◽

Hybrid Neural Network

Download Full-text

Weighted connected domination and Steiner trees in distance-hereditary graphs

Combinatorics and Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-61576-8_72 ◽

1996 ◽

pp. 48-52 ◽

Author(s):

Hong-Gwa Yeh ◽

Gerard J. Chang

Keyword(s):

Download Full-text

On integer multiflows and metric packings in matroids

Combinatorics and Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-61576-8_85 ◽

1996 ◽

pp. 218-233

Author(s):

Karina Marcus ◽

András Sebő

Download Full-text

Some applications of combinatorial optimization in parallel computing

Combinatorics and Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-61576-8_95 ◽

1996 ◽

pp. 348-366

Author(s):

Reinhardt Euler ◽

Laurent Lemarchand

Keyword(s):

Parallel Computing ◽

Combinatorial Optimization

Download Full-text

Worst-case analysis for on-line data compression

Combinatorics and Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-61576-8_90 ◽

1996 ◽

pp. 288-300

Author(s):

József Békési ◽

Gábor Galambos ◽

Ulrich Pferschy ◽

Gerhard J. Woeginger

Keyword(s):

Data Compression ◽

Case Analysis ◽

Worst Case Analysis ◽

Download Full-text

Enumeration algorithm for the edge coloring problem on bipartite graphs

Combinatorics and Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-61576-8_69 ◽

1996 ◽

pp. 18-26 ◽

Author(s):

Yasuko Matsui ◽

Tomomi Matsui

Keyword(s):

Edge Coloring ◽

Bipartite Graphs ◽

Enumeration Algorithm ◽

Coloring Problem

Download Full-text

Finding an antidirected Hamiltonian path starting with a forward arc from a given vertex of a tournament

Combinatorics and Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-61576-8_75 ◽

1996 ◽

pp. 67-73 ◽

Author(s):

E. Bampis ◽

P. Hell ◽

Y. Manoussakis ◽

M. Rosenfeld

Keyword(s):

Hamiltonian Path

Download Full-text

On the parallel complexity of the alternating Hamiltonian cycle problem

Combinatorics and Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-61576-8_96 ◽

1996 ◽

pp. 367-377

Author(s):

E. Bampis ◽

Y. Manoussakis ◽

I. Milis

Keyword(s):

Hamiltonian Cycle ◽

Parallel Complexity ◽

Hamiltonian Cycle Problem

Download Full-text