779 search results - page 132 / 156 » A graph polynomial for independent sets of bipartite graphs |
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
DCOSS
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
VLSID
2002
IEEE
14 years 7 months ago
2002
IEEE
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
WCNC
2008
IEEE
14 years 1 months ago
2008
IEEE
— In this paper, we address the network maintenance problem, in which we aim to maximize the lifetime of a sensor network by adding a set of relays to it. The network lifetime is...