534 search results - page 10 / 107 » Diameter critical graphs |
DM
2011
13 years 4 months ago
2011
MST
2010
13 years 4 months ago
2010
GC
2002
Springer
13 years 9 months ago
2002
Springer
An orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exactly one arc between x and y for every pair x = y of vertices such that both xy and yx a...
INFOCOM
2005
IEEE
14 years 3 months ago
2005
IEEE
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
ABSTRACT. Upon the discovery of power laws [8, 16, 30], a large body of work in complex network analysis has focused on developing generative models of graphs which mimick real-wor...