Sciweavers

2270 search results - page 76 / 454
» On the distribution of eigenvalues of graphs
Sort
View
ICML
2007
IEEE
16 years 7 months ago
Scalable modeling of real graphs using Kronecker multiplication
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum,...
Jure Leskovec, Christos Faloutsos
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
16 years 3 months ago
Top-k Correlative Graph Mining.
Correlation mining has been widely studied due to its ability for discovering the underlying occurrence dependency between objects. However, correlation mining in graph databases ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
INFOCOM
2011
IEEE
14 years 9 months ago
Approximate distance queries and compact routing in sparse graphs
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
ICPP
1999
IEEE
15 years 10 months ago
The Index-Permutation Graph Model for Hierarchical Interconnection Networks
In this paper, we present the index-permutation (IP) graph model, and apply it to the systematic development of efficient hierarchical networks. We derive several classes of inter...
Chi-Hsiang Yeh, Behrooz Parhami
FOCS
2008
IEEE
16 years 19 days ago
Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
Amit Chakrabarti, Alexander Jaffe, James R. Lee, J...