325 search results - page 21 / 65 » Hamilton cycles in random graphs and directed graphs |
COMBINATORICS
2006
13 years 8 months ago
2006
For undirected graphs it has been known for some time that one can bound the diameter using the eigenvalues. In this note we give a similar result for the diameter of strongly con...
RSA
2006
13 years 8 months ago
2006
Motivated by a problem that arises in the study of mirrored storage systems, we describe, for any fixed , > 0 and any integer d 2, explicit or randomized constructions of d-r...
COLOGNETWENTE
2009
13 years 9 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
SIGMETRICS
2010
ACM
13 years 7 months ago
2010
ACM
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
SIGCOMM
2010
ACM
13 years 8 months ago
2010
ACM
Microblogging services, such as Twitter, are among the most important online social networks(OSNs). Different from OSNs such as Facebook, the topology of microblogging service is ...