50 search results - page 9 / 10 » A combinatorial algorithm for weighted stable sets in bipart... |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
TAMC
2009
Springer
14 years 2 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
COMPSEC
2010
13 years 6 months ago
2010
In this paper we address the problem of reducing the role mining complexity in RBAC systems. To this aim, we propose a three steps methodology: first, we associate a weight to rol...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
We study bargaining games between suppliers and manufacturers in a network context. Agents wish to enter into contracts in order to generate surplus which then must be divided amon...