736 search results - page 87 / 148 » Distinguishing geometric graphs |
164
click to vote
TCOM
2010
15 years 4 months ago
2010
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...
171
click to vote
TNN
2010
15 years 20 days ago
2010
In this paper we provide theoretical and numerical analysis of a geometric activity flow network model which is aimed at explaining mathematically the scale-free functional graph s...
156
Voted
INFOCOM
2011
IEEE
14 years 9 months ago
2011
IEEE
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...
192
click to vote
SIAMDM
2010
15 years 21 days ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
217
click to vote
ECCC
2007
15 years 5 months ago
2007
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...