3818 search results - page 150 / 764 » Word Problems on Compressed Words |
129
Voted
SWAT
1998
Springer
15 years 9 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
138
click to vote
MIC
2003
15 years 6 months ago
2003
E.I.Verriest and F.L.Lewis have presented in [1] a new method to approach the minimum-time control of linear continous-time systems avoiding the Bang-Bang control. Their method re...
142
Voted
ALGORITHMICA
2006
15 years 5 months ago
2006
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
129
Voted
ALGORITHMICA
2006
15 years 5 months ago
2006
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
149
Voted
EOR
2006
15 years 5 months ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...