Sciweavers

3268 search results - page 75 / 654
» The hub number of a graph
Sort
View
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
15 years 7 months ago
Bipartite roots of graphs
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
Lap Chi Lau
P2P
2008
IEEE
184views Communications» more  P2P 2008»
16 years 17 days ago
Ad Hoc Limited Scale-Free Models for Unstructured Peer-to-Peer Networks
Several protocol efficiency metrics (e.g., scalability, search success rate, routing reachability and stability) depend on the capability of preserving structure even over the ch...
Hasan Guclu, Durgesh Kumari, Murat Yuksel
ICCS
2005
Springer
15 years 11 months ago
Effectiveness of Vaccination Strategies for Infectious Diseases According to Human Contact Networks
A ‘contact network’ modeling infection transmission comprises of nodes (or individuals) that are linked when they are in contact that possibly transmits an infection. We here s...
Fumihiko Takeuchi, Kenji Yamamoto
AGILEDC
2003
IEEE
15 years 11 months ago
Agile Development in the old economy
As part of the delivery an automated hub for a postal operator, the Solystic company has to build a complex and feature rich Information System that supports a highly automated pr...
Géry Derbier
HT
1998
ACM
15 years 10 months ago
Inferring Web Communities from Link Topology
The World Wide Web grows through a decentralized, almost anarchic process, and this has resulted in a large hyperlinked corpus without the kind of logical organization that can be...
David Gibson, Jon M. Kleinberg, Prabhakar Raghavan