Sciweavers

225 search results - page 41 / 45
» Stably Computable Properties of Network Graphs
Sort
View
135
Voted
WWW
2011
ACM
14 years 10 months ago
Finding the bias and prestige of nodes in networks based on trust scores
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
Abhinav Mishra, Arnab Bhattacharya
WIOPT
2006
IEEE
15 years 9 months ago
Color-based broadcasting for ad hoc networks
— This paper develops a novel color-based broadcast scheme for wireless ad hoc networks where each forwarding of the broadcast message is assigned a color from a given pool of co...
Alireza Keshavarz-Haddad, Vinay J. Ribeiro, Rudolf...
131
Voted
BMCBI
2007
202views more  BMCBI 2007»
15 years 3 months ago
ProtNet: a tool for stochastic simulations of protein interaction networks dynamics
Background: Protein interactions support cell organization and mediate its response to any specific stimulus. Recent technological advances have produced large data-sets that aim ...
Massimo Bernaschi, Filippo Castiglione, Alessandra...
149
Voted
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
15 years 10 months ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...
123
Voted
ECCC
2006
145views more  ECCC 2006»
15 years 3 months ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder