ISSN 1944-9488
Vol. 8, Issue 1, 2012February 29, 2012 EDT
Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning
Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning
Articles in Vol. 8, Issue 1, 2012
Vol. 8, Issue 1, 2012
- Geometric Protean GraphsPaweł PrałatJeannette JanssenAnthony Bonato
- Constant Price of Anarchy in Network-Creation Games via Public-Service AdvertisingMorteza ZadimoghaddamErik D. Demaine
- Finding and Visualizing Graph Clusters Using PageRank OptimizationAlexander TsiatasFan Chung
- Fast Matrix Computations for Pairwise and Columnwise Commute Times and Katz ScoresDavid F. GleichPooya EsfandiarLaks V.S. LakshmananFrancesco BonchiChen Greif
- Multiplicative Attribute Graph Model of Real-World NetworksJure LeskovecMyunghwan Kim
- Efficient Triangle Counting in Large Graphs via Degree-Based Vertex PartitioningCharalampos E. TsourakakisRichard PengMihail N. KolountzakisGary L. Miller
- Introduction to the Special Issue on Algorithms and Models for the Web GraphAnthony BonatoD. SivakumarRavi Kumar
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.