296 search results - page 23 / 60 » Group connectivity of certain graphs |
87
Voted
ASUNAM
2009
IEEE
15 years 1 months ago
2009
IEEE
In this paper, we present a horizontal view of social influence, more specifically a quantitative study of the influence of neighbours on the probability of a particular node to jo...
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
109
click to vote
LANMR
2004
14 years 11 months ago
2004
In previous work we have discussed the importance of identifying the cycles that occur in a logic program under the answer set semantics, and the connections between cycles, that w...
IPCO
1993
14 years 11 months ago
1993
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
AAAI
2007
14 years 12 months ago
2007
We introduce a distributed negotiation framework for multiagent resource allocation where interactions between agents are limited by a graph defining a negotiation topology. A gr...