Skip to main content
null
Internet Mathematics
  • Menu
  • Articles
    • General
    • Special Issue for WAW'15
    • Special Issue for WAW'16
    • All
  • For Authors
  • Editorial Board
  • About
  • Issues
  • Blog
  • search

RSS Feed

Enter the URL below into your favorite RSS reader.

http://localhost:5959/feed
General
Vol. 8, Issue 1, 2012February 29, 2012 EDT

Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning

Charalampos E. Tsourakakis, Richard Peng, Mihail N. Kolountzakis, Gary L. Miller,
math
https://doi.org/10.1080/15427951.2012.625260
Internet Mathematics
Tsourakakis, Charalampos E., Richard Peng, Mihail N. Kolountzakis, and Gary L. Miller. 2012. “Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning.” Internet Mathematics 8 (1). https:/​/​doi.org/​10.1080/​15427951.2012.625260.
Save article as...▾

View more stats

This website uses cookies

We use cookies to enhance your experience and support COUNTER Metrics for transparent reporting of readership statistics. Cookie data is not sold to third parties or used for marketing purposes.

Powered by Scholastica, the modern academic journal management system