1297 search results - page 80 / 260 » fews 2007 |
CORR
2007
Springer
14 years 11 months ago
2007
Springer
—In ad hoc networks scalability is a critical requirement if these technologies have to reach their full potential. Most of the proposed routing protocols do not operate efficien...
DCG
2007
14 years 11 months ago
2007
We extend to topological affine planes the standard theorems of convexity, among them the separation theorem, the anti-exchange theorem, Radon’s, Helly’s, Carath´eodory’s,...
EOR
2007
14 years 11 months ago
2007
The knapsack problem (KP) is generalized to the case where items are partially ordered through a set of precedence relations. As in ordinary KPs, each item is associated with pro...
105
click to vote
IJFCS
2007
14 years 11 months ago
2007
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
106
click to vote
IPL
2007
14 years 11 months ago
2007
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...