2079 search results - page 127 / 416 » Universality of random graphs |
122
click to vote
COMBINATORICS
1998
15 years 4 months ago
1998
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed properties as covering spaces of small base graphs. This makes them suitable for ap...
149
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
A unified framework to obtain all known lower bounds (random coding, typical random coding and expurgated bound) on the reliability function of a point-to-point discrete memoryles...
156
click to vote
PKDD
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. This paper proposes a novel approach named AGM to eciently mine the association rules among the frequently appearing substructures in a given graph data set. A graph tran...
116
click to vote
JGT
2006
15 years 4 months ago
2006
We find the maximum number of maximal independent sets in two families of graphs. The first family consists of all graphs with n vertices and at most r cycles. The second family i...
136
click to vote
ICDM
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...