1493 search results - page 160 / 299 » Local resilience of graphs |
CSL
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Although Cai, F¨urer and Immerman have shown that fixedpoint logic with counting (IFP + C) does not express all polynomialtime properties of finite structures, there h...
ICDCS
2005
IEEE
14 years 1 months ago
2005
IEEE
The link structure of the Web graph is used in algorithms such as Kleinberg’s HITS and Google’s PageRank to assign authoritative weights to Web pages and thus rank them. Both ...
DCOSS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a distributed, localized and integrated approach for establishing both low-level (i.e. exploration of 1-hop neighbors, interference avoidance) and high-level (...
KDD
2004
ACM
14 years 1 months ago
2004
ACM
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
HYBRID
2001
Springer
14 years 16 days ago
2001
Springer
Efficient algorithms exist for fault detection and isolation of physical systems based on functional redundancy. In a qualitative approach, this redundancy can be captured by a tem...