Sciweavers

141 search results - page 3 / 29
» Partitioning Approach to Visualization of Large Graphs
Sort
View
SAC
2005
ACM
14 years 1 months ago
Discovering parametric clusters in social small-world graphs
We present a strategy for analyzing large, social small-world graphs, such as those formed by human networks. Our approach brings together ideas from a number of different resear...
Jonathan McPherson, Kwan-Liu Ma, Michael Ogawa
PE
2011
Springer
167views Optimization» more  PE 2011»
13 years 2 months ago
Passage-time computation and aggregation strategies for large semi-Markov processes
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...
Marcel C. Guenther, Nicholas J. Dingle, Jeremy T. ...
IJMMS
2007
166views more  IJMMS 2007»
13 years 7 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...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 2 months ago
Sparse Cut Projections in Graph Streams
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...
VISSOFT
2002
IEEE
14 years 11 days ago
Metrics-Based 3D Visualization of Large Object-Oriented Programs
In this paper a new approach for a metrics based software visualization is presented which supports an efficient and effective quality assessment of large object-oriented software...
Claus Lewerentz, Frank Simon