745 search results - page 88 / 149 » On Generating Random Network Structures: Connected Graphs |
109
click to vote
WEA
2010
Springer
15 years 5 months ago
2010
Springer
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
HT
1991
ACM
15 years 4 months ago
1991
ACM
In order to combine hypertext with database facilities, we show how to extract an effective storage structure from given instance relationships. The schema of the structure recogn...
141
click to vote
DIALM
2003
ACM
15 years 5 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
95
Voted
ICS
2010
Tsinghua U.
15 years 10 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
105
click to vote
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...