Sciweavers

2004 search results - page 20 / 401
» Sampling from large graphs
Sort
View
PVLDB
2010
151views more  PVLDB 2010»
14 years 10 months ago
Scalable Discovery of Best Clusters on Large Graphs
The identiï¬cation of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ï...
Kathy Macropol, Ambuj K. Singh
IJMMS
2007
166views more  IJMMS 2007»
14 years 11 months ago
Visualization of large networks with min-cut plots, A-plots and R-MAT
What does a ‘normal’ computer (or social) network look like? How can we spot ‘abnormal’ sub-networks in the Internet, or web graph? The answer to such questions is vital f...
Deepayan Chakrabarti, Christos Faloutsos, Yiping Z...
APVIS
2004
15 years 1 months ago
Adding Filtering to Geometric Distortion to Visualize a Clustered Graph on Small Screens.
Presenting large amounts of information in a limited screen space is a significant challenge in the field of Information Visualization. With the rapid development and growing use ...
Wanchun Li, Masahiro Takatsuka
INFOCOM
2008
IEEE
15 years 6 months ago
Complex Network Measurements: Estimating the Relevance of Observed Properties
Abstract—Complex networks, modeled as large graphs, received much attention during these last years. However, data on such networks is only available through intricate measuremen...
Matthieu Latapy, Clémence Magnien
GC
2010
Springer
14 years 9 months ago
Cycle Lengths in Hamiltonian Graphs with a Pair of Vertices Having Large Degree Sum
A graph of order n is said to be pancyclic if it contains cycles of all lengths from three to n. Let G be a hamiltonian graph and let x and y be vertices of G that are consecutive ...
Michael Ferrara, Michael S. Jacobson, Angela Harri...