813 search results - page 65 / 163 » On the Boolean-Width of a Graph: Structure and Applications |
KDD
2007
ACM
14 years 9 months ago
2007
ACM
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
VMCAI
2009
Springer
14 years 4 months ago
2009
Springer
Abstract There is an intimate link between program structure and behaviour. Exploiting this link to phrase program correctness problems in terms of the structural properties of a p...
WADS
2001
Springer
14 years 1 months ago
2001
Springer
Methods for ranking World Wide Web resources according to their position in the link structure of the Web are receiving considerable attention, because they provide the ļ¬rst eļ¬...
WWW
2010
ACM
14 years 4 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...
ICCD
2000
IEEE
14 years 1 months ago
2000
IEEE
This paper presents a veriļ¬cation technique for functional comparison of large combinational circuits using a novel combination of known approaches. The idea is based on a tight...