Sciweavers

DAM
1999
77views more  DAM 1999»
13 years 4 months ago
Compound Constructions of Broadcast Networks
Compound methods have been shown to be very e ective in the construction of broadcast graphs. Compound methods generate a large broadcast graph by combining multiple copies of a b...
Michael J. Dinneen, Jose A. Ventura, Mark C. Wilso...
DAM
1999
128views more  DAM 1999»
13 years 4 months ago
Graph Classes Between Parity and Distance-hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
Serafino Cicerone, Gabriele Di Stefano
DAM
1999
81views more  DAM 1999»
13 years 4 months ago
On the Extension of Bipartite to Parity Graphs
Parity graphs form a superclass of bipartite and distance-hereditary graphs. Since their introduction, all the algorithms proposed as solutions to the recognition problem and othe...
Serafino Cicerone, Gabriele Di Stefano
DAM
1999
102views more  DAM 1999»
13 years 4 months ago
On some Properties of DNA Graphs
Molecular biology which aims to study DNA and protein structure and functions, has stimulated research in di erent scienti
Jacek Blazewicz, Alain Hertz, Daniel Kobler, Domin...
DAM
1999
75views more  DAM 1999»
13 years 4 months ago
On k-partitioning of Hamming Graphs
Sergei L. Bezrukov, Robert Elsässer, Ulf-Pete...
DAM
1999
64views more  DAM 1999»
13 years 4 months ago
Simple 8-(40, 11, 1440) Designs
Anton Betten, Reinhard Laue, Alfred Wassermann
DAM
1999
71views more  DAM 1999»
13 years 4 months ago
The Proper Linear Spaces on 17 Points
Anton Betten, Dieter Betten
DAM
1999
81views more  DAM 1999»
13 years 4 months ago
On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs
We survey results on the sequential and parallel complexity of hamiltonian path and cycle problems in various classes of digraphs which generalize tournaments. We give detailed in...
Jørgen Bang-Jensen, Gregory Gutin
DAM
1999
70views more  DAM 1999»
13 years 4 months ago
On Maximal Shadows of Members in Left-compressed Sets
Whereas Stanley, Proctor and others studied Sperner properties of the poset L(k; m) we consider shadows of left-compressed sets and derive asymptotic bounds on their sizes. ? 1999...
Rudolf Ahlswede, Zhen Zhang