DAM
2000
13 years 4 months ago
2000
Thomassen (J. Combin. Theory Ser. B 28, 1980, 142
DAM
2000
13 years 4 months ago
2000
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
DAM
2000
13 years 4 months ago
2000
DAM
2000
13 years 4 months ago
2000
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...
DAM
2000
13 years 4 months ago
2000
Abstract. The amalgamation of leaf-labelled (phylogenetic) trees on overlapping leaf sets into one (super)tree is a central problem in several areas of classification, particularly...
DAM
2000
13 years 4 months ago
2000
An (n; k)-sequence has been studied. A permutation a1; a2; : : : ; akn of 0; 1; : : : ; kn - 1 is an (n; k)-sequence if as+d -as at+d -at (mod n) whenever as+d=n = as=n and at+d=...
DAM
2000
13 years 4 months ago
2000
DAM
2000
13 years 4 months ago
2000
DAM
2000
13 years 4 months ago
2000
DAM
2000
13 years 4 months ago
2000
We use basic results from graph theory to design algorithms for constructing three-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. ...