2503 search results - page 192 / 501 » A study of 3-arc graphs |
163
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
224
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
ABSTRACT. Reeb graphs provide a method for studying the shape of a manifold by encoding the evolution and arrangement of level sets of a simple Morse function defined on
148
Voted
JCT
2008
15 years 6 months ago
2008
We study packings of graphs with given maximal degree. We shall prove that the (hitherto unproved) Bollob
123
click to vote
APPML
2004
15 years 6 months ago
2004
We study preservation of distance regularity when taking strong sums and strong products of distance-regular graphs. MSC 2000 Classification: 05C12
176
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Abstract. In this paper we present static and dynamic studies of duplicate and near-duplicate documents in the Web. The static and dynamic studies involve the analysis of similar c...