External-memory network analysis algorithms for naturally sparse graphs

Authors:
Michael T. Goodrich;Paweł Pszona
Affiliations:
Dept. of Computer Science, University of California, Irvine;Dept. of Computer Science, University of California, Irvine
Venue:
ESA'11 Proceedings of the 19th European conference on Algorithms
Year:
2011

Citing 14
Cited 3

Planar orientations with low out-degree and compaction of adjacency matrices

Theoretical Computer Science
The Linkage of a Graph

SIAM Journal on Computing
Sudden emergence of a giant k-core in a random graph

Journal of Combinatorial Theory Series B
A Sufficient Condition for Backtrack-Free Search

Journal of the ACM (JACM)
The small-world phenomenon: an algorithmic perspective

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Algorithm 457: finding all cliques of an undirected graph

Communications of the ACM
External memory algorithms and data structures: dealing with massive data

ACM Computing Surveys (CSUR)
The worst-case time complexity for generating all maximal cliques and computational experiments

Theoretical Computer Science - Computing and combinatorics
The k-core and branching processes

Combinatorics, Probability and Computing
Parameterized Complexity for Domination Problems on Degenerate Graphs

Graph-Theoretic Concepts in Computer Science
Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs

Algorithmica
Efficient core decomposition in massive networks

ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Listing all maximal cliques in large sparse real-world graphs

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
External-memory network analysis algorithms for naturally sparse graphs

ESA'11 Proceedings of the 19th European conference on Algorithms

External-memory network analysis algorithms for naturally sparse graphs

ESA'11 Proceedings of the 19th European conference on Algorithms
I/O-efficient hierarchical diameter approximation

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Fixed points of graph peeling

Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

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: 1. Finding an approximate d-degeneracy ordering. 2. Finding a cycle of length exactly c. 3. 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.