An optimal algorithm for counting network motifs. Itzhack, R., Mogilevski, Y., & Louzoun, Y. Physica A: Statistical Mechanics and its Applications, 381:482–490, 07, 2007.
An optimal algorithm for counting network motifs [link]Paper  bibtex   
@article{Itzhack2007,
  added-at = {2008-04-22T10:36:30.000+0200},
  author = {Itzhack, Royi and Mogilevski, Yelena and Louzoun, Yoram},
  biburl = {https://www.bibsonomy.org/bibtex/2a03e7c99dee62fa2433c4c6f5520bd16/smicha},
  day = 15,
  description = {Physica A},
  interhash = {f30451d538a948ce934484811cf09ce2},
  intrahash = {a03e7c99dee62fa2433c4c6f5520bd16},
  journal = {Physica A: Statistical Mechanics and its Applications},
  keywords = {Graph},
  month = {07},
  pages = {482--490},
  timestamp = {2008-04-22T10:51:02.000+0200},
  title = {An optimal algorithm for counting network motifs},
  url = {http://www.sciencedirect.com/science/article/B6TVG-4N6FFRS-D/1/fa56ce707294d2a73063ff9c3662d8d7},
  volume = 381,
  year = 2007
}

Downloads: 0