3415 search results - page 410 / 683 » Lower bounds on kernelization |
142
click to vote
MIDDLEWARE
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. This paper describes an event dissemination algorithm that impletopic-based publish/subscribe interaction abstraction in mobile ad-hoc networks (MANETs). Our algorithm is...
216
click to vote
PDCAT
2005
Springer
16 years 3 days ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
182
click to vote
WG
2005
Springer
16 years 2 days ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
168
Voted
APPROX
2004
Springer
16 years 19 hour ago
2004
Springer
In the Minimum Common String Partition problem (MCSP) we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the numbe...
138
click to vote
COCO
2004
Springer
16 years 14 hour ago
2004
Springer
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...