Sciweavers

2270 search results - page 75 / 454
» On the distribution of eigenvalues of graphs
Sort
View
SODA
2012
ACM
268views Algorithms» more  SODA 2012»
13 years 9 months ago
Analyzing graph structure via linear measurements
We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n...
Kook Jin Ahn, Sudipto Guha, Andrew McGregor
SODA
2008
ACM
112views Algorithms» more  SODA 2008»
15 years 8 months ago
The effect of induced subgraphs on quasi-randomness
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
Asaf Shapira, Raphael Yuster
WAIM
2010
Springer
15 years 5 months ago
HyperGraphDB: A Generalized Graph Database
We present HyperGraphDB, a novel graph database based on generalized hypergraphs where hyperedges can contain other hyperedges. This generalization automatically reifies every ent...
Borislav Iordanov
LAWEB
2003
IEEE
16 years 3 days ago
Clustering the Chilean Web
We perform a clustering of the Chilean Web Graph using a local fitness measure, optimized by simulated annealing, and compare the obtained cluster distribution to that of two mod...
Satu Virtanen
CORR
2010
Springer
120views Education» more  CORR 2010»
15 years 4 months ago
Typicality Graphs:Large Deviation Analysis
Let X and Y be finite alphabets and PXY a joint distribution over them, with PX and PY representing the marginals. For any > 0, the set of n-length sequences xn and yn that ar...
Ali Nazari, Ramji Venkataramanan, Dinesh Krithivas...