Sciweavers

865 search results - page 104 / 173
» Random graph models for the web graph
Sort
View
ICCSA
2010
Springer
15 years 5 months ago
Efficient Algorithms for the 2-Center Problems
This paper achieves O(n3 log log n/ log n) time for the 2center problems on a directed graph with non-negative edge costs under the conventional RAM model where only arithmetic ope...
Tadao Takaoka
ACTAC
2007
69views more  ACTAC 2007»
15 years 4 months ago
Synthesising Robust Schedules for Minimum Disruption Repair Using Linear Programming
An o-line scheduling algorithm considers resource, precedence, and synchronisation requirements of a task graph, and generates a schedule guaranteeing its timing requirements. Th...
Dávid Hanák, Nagarajan Kandasamy
CORR
2006
Springer
102views Education» more  CORR 2006»
15 years 4 months ago
Structural Inference of Hierarchies in Networks
One property of networks that has received comparatively little attention is hierarchy, i.e., the property of having vertices that cluster together in groups, which then join to f...
Aaron Clauset, Cristopher Moore, M. E. J. Newman
PODC
2004
ACM
15 years 9 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen
145
Voted
WWW
2009
ACM
16 years 4 months ago
Relationalizing RDF stores for tools reusability
The emergence of Semantic Web technologies and standards such as Resource Description Framework (RDF) has introduced novel data storage models such as the RDF Graph Model. In this...
Sunitha Ramanujam, Anubha Gupta, Latifur Khan, Ste...