665 search results - page 8 / 133 » A Sub-cubic Time Algorithm for the k -Maximum Subarray Probl... |
WADS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5k kn2 ). The algor...
AIPS
2009
13 years 9 months ago
2009
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
CATS
2008
13 years 10 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
WADS
2005
Springer
14 years 2 months ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
ASIAMS
2007
IEEE
14 years 2 months ago
2007
IEEE
The tree structure has received much interest as a versatile architecture for a large class of parallel processing applications. Spanning trees in particular are essential tools f...