310 search results - page 24 / 62 » dam 2008 |
DAM
2007
13 years 9 months ago
2007
: In this paper we deal with the arc ranking problem of directed graphs. We give some classes of graphs for which the arc ranking problem is polynomially solvable. We prove that de...
DAM
2000
13 years 9 months ago
2000
Let us denote a b = max(a; b) and a b = a + b for a; b R and extend this pair of operations to matrices and vectors in the same way as in conventional linear algebra, that is i...
DAM
2000
13 years 9 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. ...
DAM
2000
13 years 9 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 9 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...