The Rocky Mountain Journal of Mathematics, Vol. 32, No. 2 (SUMMER 2002), pp. 589-605 (17 pages) We evaluate the determinant ${\det _{1 \leqslant i,j \leqslant n ...

One formulation of the machine sequencing problem is that of finding a minimaximal path in a disjunctive graph. This paper describes an implicit enumeration procedure that solves the problem by ...

Our research is focused on graph algorithms, from both a theoretical perspective, and a practical perspective motivated by real-world problems in Bioinformatics, such as genome sequencing technologies ...