Sciweavers

966 search results - page 20 / 194
» Small Alliances in Graphs
Sort
View
WWW
2010
ACM
14 years 3 months ago
Measurement-calibrated graph models for social network experiments
Access to realistic, complex graph datasets is critical to research on social networking systems and applications. Simulations on graph data provide critical evaluation of new sys...
Alessandra Sala, Lili Cao, Christo Wilson, Robert ...
IJCAI
2001
13 years 10 months ago
Search on High Degree Graphs
We show that nodes of high degree tend to occur infrequently in random graphs but frequently in a wide variety of graphs associated with real world search problems. We then study ...
Toby Walsh
CORR
2012
Springer
228views Education» more  CORR 2012»
12 years 4 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled
CSB
2005
IEEE
119views Bioinformatics» more  CSB 2005»
14 years 2 months ago
Temperature and Mutation Switches in the Secondary Structure of Small RNAs
Conformational switching in the secondary structure of RNAs has recently attracted considerable attention, fostered by the discovery of ‘riboswitches’ in living organisms. The...
Assaf Avihoo, Danny Barash
PDCAT
2005
Springer
14 years 2 months ago
Optimal Routing in a Small-World Network
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
Jianyang Zeng, Wen-Jing Hsu