"Efficient Triangle Counting in Large Graphs via Degree-Based Vertex ..."

Mihail N. Kolountzakis et al. (2012)

> Home

Details and statistics

DOI: 10.1080/15427951.2012.625260

access: closed

type: Journal Article

metadata version: 2023-05-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/im/KolountzakisMPT12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/im/KolountzakisMPT12
Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis:
Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning. Internet Math. 8(1-2): 161-185 (2012)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.