3105 search results - page 150 / 621 » The Path-Packing Structure of Graphs |
133
click to vote
DAC
2004
ACM
16 years 4 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
128
click to vote
WWW
2010
ACM
15 years 10 months ago
2010
ACM
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
100
Voted
SIGECOM
2009
ACM
15 years 10 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. ...
129
click to vote
ICCD
2000
IEEE
15 years 8 months ago
2000
IEEE
This paper presents a verification technique for functional comparison of large combinational circuits using a novel combination of known approaches. The idea is based on a tight...
98
Voted
IJCAI
1997
15 years 4 months ago
1997
Marco Gori Dipartimento di Ingegneria deU'Informazione Universita di Siena Via Roma 56 53100 Siena, Italy Alessandro Sperduti Dipartimento di Informatica Universita di Pisa C...