Subgraph Enumeration in Large Social Contact Networks Using Parallel Color Coding and Streaming

@article{Zhao2010SubgraphEI,
  title={Subgraph Enumeration in Large Social Contact Networks Using Parallel Color Coding and Streaming},
  author={Zhao Zhao and M. Khan and V. Kumar and M. Marathe},
  journal={2010 39th International Conference on Parallel Processing},
  year={2010},
  pages={594-603}
}
  • Zhao Zhao, M. Khan, +1 author M. Marathe
  • Published 2010
  • Computer Science
  • 2010 39th International Conference on Parallel Processing
  • Identifying motifs (or commonly occurring subgraphs/templates) has been found to be useful in a number of applications, such as biological and social networks; they have been used to identify building blocks and functional properties, as well as to characterize the underlying networks. Enumerating subgraphs is a challenging computational problem, and all prior results have considered networks with a few thousand nodes. In this paper, we develop a parallel subgraph enumeration algorithm, ParSE… CONTINUE READING
    Enumerating subgraph instances using map-reduce
    • 106
    • PDF
    SAHAD: Subgraph Analysis in Massive Networks Using Hadoop
    • 72
    • PDF
    Scalable Subgraph Enumeration in MapReduce
    • 63
    • PDF
    Fast Approximate Subgraph Counting and Enumeration
    • 39
    • PDF
    Counting Graphlets: Space vs Time
    • 39
    • PDF
    DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine
    • 33
    • PDF
    Scalable Distributed Subgraph Enumeration
    • 40
    • PDF
    Network Motif Discovery: A GPU Approach
    • 27
    • PDF
    Complex Network Analysis Using Parallel Approximate Motif Counting
    • 25
    • Highly Influenced
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 15 REFERENCES
    Network motifs: simple building blocks of complex networks.
    • 5,634
    • PDF
    Algorithm 457: finding all cliques of an undirected graph
    • 1,973
    • PDF
    Frequent subgraph discovery
    • 1,166
    • PDF
    A (sub)graph isomorphism algorithm for matching large graphs
    • 1,023
    • PDF
    Patterns of Influence in a Recommendation Network
    • 334
    • PDF
    Biomolecular network motif counting and discovery by color coding
    • 145
    • Highly Influential
    • PDF
    A scalable, parallel algorithm for maximal clique enumeration
    • 124
    • PDF
    Generation and analysis of large synthetic social contact networks
    • 159
    • PDF
    Counting stars and other small subgraphs in sublinear time
    • 41
    • PDF
    Approximating the Number of Network Motifs
    • 30
    • PDF