14 search results - page 3 / 3 » Parameterized Complexity Results for General Factors in Bipa... |
STOC
2005
ACM
14 years 6 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
ATAL
2005
Springer
13 years 11 months ago
2005
Springer
Methods for solving Distributed Constraint Optimization Problems (DCOP) have emerged as key techniques for distributed reasoning. Yet, their application faces significant hurdles...
TON
2002
13 years 5 months ago
2002
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for great...