Sciweavers

Share
DAM
2000
83views more  DAM 2000»
9 years 1 months ago
Pancyclic out-arcs of a Vertex in Tournaments
Thomassen (J. Combin. Theory Ser. B 28, 1980, 142
Tianxing Yao, Yubao Guo, Kemin Zhang
DAM
2000
199views more  DAM 2000»
9 years 1 months ago
Approximation algorithms for the shortest total path length spanning tree problem
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
DAM
2000
68views more  DAM 2000»
9 years 1 months ago
Uncolorable Mixed Hypergraphs
Zsolt Tuza, Vitaly I. Voloshin
DAM
2000
97views more  DAM 2000»
9 years 1 months ago
Algorithms and obstructions for linear-width and related search parameters
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;:::...
Dimitrios M. Thilikos
DAM
2000
86views more  DAM 2000»
9 years 1 months ago
A supertree method for rooted trees
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...
Charles Semple, Mike A. Steel
DAM
2000
78views more  DAM 2000»
9 years 1 months ago
On (n, k)-sequences
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=...
Hong-Yeop Song, June Bok Lee
DAM
2000
61views more  DAM 2000»
9 years 1 months ago
A polyhedral approach to sequence alignment problems
John D. Kececioglu, Hans-Peter Lenhof, Kurt Mehlho...
DAM
2000
84views more  DAM 2000»
9 years 1 months ago
Three-dimensional orthogonal graph drawing algorithms
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. ...
Peter Eades, Antonios Symvonis, Sue Whitesides
books