Sciweavers

DAM
2007
75views more  DAM 2007»
13 years 4 months ago
An efficient condition for a graph to be Hamiltonian
Shengjia Li, Ruijuan Li, Jinfeng Feng
DAM
2007
85views more  DAM 2007»
13 years 4 months ago
Testing primitivity on partial words
Primitive words, or strings over a finite alphabet that cannot be written as a power of another string, play an important role in numerous research areas including formal language...
Francine Blanchet-Sadri, Arundhati R. Anavekar
DAM
2007
61views more  DAM 2007»
13 years 4 months ago
Waiting times for clumps of patterns and for structured motifs in random sequences
Valery T. Stefanov, Stéphane Robin, Sophie ...
DAM
2007
78views more  DAM 2007»
13 years 4 months ago
Flow trees for vertex-capacitated networks
Given a graph G = (V, E) with a cost function c(S) ≥ 0 ∀S ⊆ V , we want to represent all possible min-cut values between pairs of vertices i and j. We consider also the spec...
Refael Hassin, Asaf Levin
DAM
2007
60views more  DAM 2007»
13 years 4 months ago
Restricting SBH ambiguity via restriction enzymes
The expected number of n-base long sequences consistent with a given SBH spectrum grows exponentially with n, which severely limits the potential range of applicability of SBH even...
Steven Skiena, Sagi Snir
DAM
2007
56views more  DAM 2007»
13 years 4 months ago
Classes of cycle bases
Christian Liebchen, Romeo Rizzi
DAM
2007
91views more  DAM 2007»
13 years 4 months ago
A note on the precedence-constrained class sequencing problem
We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approxi...
José R. Correa, Samuel Fiorini, Nicol&aacut...
DAM
2007
83views more  DAM 2007»
13 years 4 months ago
The proof theoretic strength of the Steinitz exchange theorem
We show that the logical theory QLA proves the Cayley–Hamilton theorem from the Steinitz exchange theorem together with a strengthening of the linear independence principle. Sin...
Michael Soltys
DAM
2007
82views more  DAM 2007»
13 years 4 months ago
Every toroidal graph without adjacent triangles is (4, 1)*-choosable
In this paper, a structural theorem about toroidal graphs is given that strengthens a result of Borodin on plane graphs. As a consequence, it is proved that every toroidal graph w...
Baogang Xu, Haihui Zhang