Discrete Applied Mathematics 1995: Vol 62 Table of Contents

2 Pages·1995·0.29 MB·English

DISCRETE APPLIED MATHEMATICS
VOLUME 62, NUMBERS 1-3, 8 SEPTEMBER 1995
SPECIAL VOLUME: PARTITIONING AND DECOMPOSITION
IN COMBINATORIAL OPTIMIZATION
Abstracted/Indexed in: ACM Computing Reviews, Cambridge Scientific
Abstracts, Current Contents: Physical, Chemical & Earth Sciences, Engineering
Index/Compendex, INSPEC Information Services, International Abstracts in
Operations Research, Mathematical Reviews, PASCAL, Science Citation Index,
Statistical Theory and Method Abstracts, Zentralblatt fur Mathematik.
CONTENTS
Preface
G. Andreatta and F. Mason
Path covering problems and testing of printed circuits
R.1. Becker and Y. Perl
The shifting algorithm technique for the partitioning of trees
L. Bianco, P. Dell’Olmo and M.G. Speranza
Scheduling independent tasks with multiple modes
E. Boros, V. Gurvich, P.L. Hammer, T. Ibaraki and A. Kogan
Decomposability of partially defined Boolean functions
P. Brucker
Efficient algorithms for some path partitioning problems
S. Chopra
Compositions for matroids with the Fulkerson property
M. Conforti, G. Cornuéjols and M.R. Rao
Decomposition of wheel-and-parachute-free balanced bipartite
graphs 103
D. Cvetkovic, P. Rowlinson and S. Simié
On some algorithmic investigations of star partitions of graphs 119
M. Davis-Moradkhan and C. Roucairol
Graph partitioning applied to the logic testing of combinational
circuits 131
C.C. de Souza and M. Laurent
Some new classes of facets for the equicut polytope 167
R. Euler and H. Le Verge
Complete linear descriptions of small asymmetric traveling salesman
polytopes 193
A.R. Mahjoub
A min — max relation for K3-covers in graphs noncontractible to K;\e 209
A. Mingozzi, S. Ricciardelli and M. Spadoni
Partitioning a matrix to minimize the maximum cost
S. Poljak and F. Rendl
Solving the max-cut problem using eigenvalues
G. Tinhofer
Bin-packing and matchings in threshold graphs
AUTHOR INDEX