Sciweavers

2125 search results - page 235 / 425
» On Graph Complexity
Sort
View
SIGECOM
2008
ACM
122views ECommerce» more  SIGECOM 2008»
15 years 6 months ago
On the windfall of friendship: inoculation strategies on social networks
This paper studies a virus inoculation game on social networks. A framework is presented which allows the measuring of the windfall of friendship, i.e., how much players benefit i...
Dominic Meier, Yvonne Anne Oswald, Stefan Schmid, ...
TALG
2008
67views more  TALG 2008»
15 years 6 months ago
Structure and linear-time recognition of 4-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
Andreas Brandstädt, Van Bang Le, R. Sritharan
DATE
2007
IEEE
130views Hardware» more  DATE 2007»
16 years 25 days ago
A novel criticality computation method in statistical timing analysis
Abstract— The impact of process variations increases as technology scales to nanometer region. Under large process variations, the path and arc/node criticality [18] provide effe...
Feng Wang 0004, Yuan Xie, Hai Ju
ICDCS
2009
IEEE
16 years 3 months ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir
CPAIOR
2006
Springer
15 years 10 months ago
Improved Algorithm for the Soft Global Cardinality Constraint
Abstract. We propose two algorithms achieving generalized arc consistency for the soft global cardinality constraint with variable-based violation and with value-based violation. T...
Alessandro Zanarini, Michela Milano, Gilles Pesant