External-Memory Network Analysis Algorithms for Naturally Sparse Graphs

Details External-Memory Network Analysis Algorithms for Naturally Sparse Graphs External-Memory Network Analysis Algorithms for Naturally Sparse Graphs

2011-06-30

arxiv.org/abs/1106.6336v1

Computer Science

Data Structures and Algorithms

23 pages, 2 figures. To appear at the 19th Annual European Symposium on Algorithms (ESA 2011)

Scientific paper

In this paper, we present a number of network-analysis algorithms in the external-memory model. We focus on methods for large naturally sparse graphs, that is, n-vertex graphs that have O(n) edges and are structured so that this sparsity property holds for any subgraph of such a graph. We give efficient external-memory algorithms for the following problems for such graphs: - Finding an approximate d-degeneracy ordering; - Finding a cycle of length exactly c; - Enumerating all maximal cliques. Such problems are of interest, for example, in the analysis of social networks, where they are used to study network cohesion.

Affiliated with

Also associated with

No associations

Rating

External-Memory Network Analysis Algorithms for Naturally Sparse Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with External-Memory Network Analysis Algorithms for Naturally Sparse Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and External-Memory Network Analysis Algorithms for Naturally Sparse Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-35836