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 Maleq Khan and V. S. Anil Kumar and Madhav V. Marathe},
  journal={2010 39th International Conference on Parallel Processing},
  year={2010},
  pages={594-603}
}
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
Highly Cited
This paper has 52 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

53 Citations

0510'13'15'17'19
Citations per Year
Semantic Scholar estimates that this publication has 53 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Generation and analysis of large synthetic social contact networks

Proceedings of the 2009 Winter Simulation Conference (WSC) • 2009
View 2 Excerpts

A parallel algorithm for extracting transcriptional regulatory network motifs

Fifth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'05) • 2005
View 2 Excerpts

Frequent subgraph discovery Finding frequent patterns in a large sparse graph

R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan
Data Mining and Knowledge Discovery • 2005