2681 search results - page 23 / 537 » Problem F |
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
APPML
2008
13 years 9 months ago
2008
In this work, the authors consider the boundary value problem y + a(t)y = g(t) f (y), 0 t 2, y(0) = y(2), y (0) = y (2), and establish the existence of nonnegative solutions in ...
CPM
2006
Springer
14 years 17 days ago
2006
Springer
Given an ordered labeled forest F ("the target forest") and an ordered labeled forest G ("the pattern forest"), the most similar subforest problem is to find a ...
CCCG
2007
13 years 10 months ago
2007
Given a rectangular boundary partitioned into rectangles, the MLC-R problem is to find a Minimum EdgeLength Corridor that visits at least one point from the boundary of every rec...
FSTTCS
2001
Springer
14 years 1 months ago
2001
Springer
We say a polynomial P over ZZM strongly M -represents a Boolean function F if F(x) ≡ P(x) (mod M) for all x ∈ {0, 1}n . Similarly, P one-sidedly M -represents F if F(x) = 0 ⇐...