4865 search results - page 697 / 973 » The Complexity of Graph Connectivity |
111
click to vote
SIGECOM
2009
ACM
15 years 11 months ago
2009
ACM
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
136
click to vote
ICDM
2007
IEEE
15 years 11 months ago
2007
IEEE
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
125
click to vote
ATVA
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
165
click to vote
ICDT
2007
ACM
15 years 11 months ago
2007
ACM
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...
139
Voted
WABI
2007
Springer
15 years 11 months ago
2007
Springer
In this paper we introduce a new method of combined synthesis and inference of biological signal transduction networks. A main idea of our method lies in representing observed cau...