Back to Results
First PageMeta Content
Random graph / Graph / Line graph / Graph theory / Mathematics / Adjacency matrix


D OULION: Counting Triangles in Massive Graphs with a Coin Charalampos E. Tsourakakis, U Kang, Gary L. Miller, and Christos Faloutsos SCS, Carnegie Mellon University Pittsburgh, PA, USA
Add to Reading List

Document Date: 2009-07-10 10:36:42

Open Document

File Size: 302,48 KB

Share Result on Facebook

City

Wiley Interscience / Baltimore / New York / Paris / Washington / DC / Philadelphia / Reading / /

Company

LinkedIn / Cambridge University Press / Google / Facebook / California Lawrence Livermore National Laboratory / Las Vegas NV / Intel / Reuters / /

Country

France / United States / /

Currency

pence / USD / /

/

Facility

University Karlsruhe / Carnegie Mellon University / University of California Lawrence Livermore National Laboratory / /

IndustryTerm

triangle-counting algorithms / triangle counting algorithms / power-law / semi-streaming algorithm / orward algorithm / graph mining applications / database systems / triangle listing algorithm / instant-messaging network / real-world networks / spectral counting algorithm / co-authorship networks / triangle counting algorithm / recent technology explosion / random sampling algorithms / large real networks / approximation algorithms / semi-streaming algorithms / semi-circle law / eigenvalue power law / power-law networks / random power law graphs / aforementioned reasons fast triangle counting algorithms / data processing / biological networks / realworld networks / linear time algorithm / naive algorithm / streaming algorithms / streaming algorithm / Web graph / social networks / state-ofthe-art algorithm / triangle counting triangle algorithm / computing / medium sized networks / straightforward triangle counting algorithm / /

Movie

Birds of a feather / /

OperatingSystem

Windows Vista / /

Organization

Cambridge University / University of California / U.S. Department of Energy / National Science Foundation / Society for Industrial and Applied Mathematics / Carnegie Mellon University Pittsburgh / IEEE Computer Society / /

Person

Christos Faloutsos / M.N. Kolountzakis / Tom Bohman / Ioannis Koutis / Gary L. Miller / /

Position

mp / General / author / straight-forward / programmer / /

Product

Edinburgh Associative Thesaurus (EAT RS) Epinions / D OULION / /

ProgrammingLanguage

R / DC / /

ProvinceOrState

Maryland / Oregon / New York / Massachusetts / /

SportsEvent

ufl / /

Technology

triangle counting algorithm / 3.1 Algorithm Our algorithm / triangle listing algorithm / Streaming Algorithms / state-ofthe-art algorithm / triangle-counting algorithms / orward algorithm / three streaming algorithms / Improved approximation algorithms / two random sampling algorithms / Semi-Streaming Algorithms / 2.1 Triangle Counting algorithms / straightforward triangle counting algorithm / semi-streaming algorithm / AlonMatias-Szegedy algorithms / Nonnumerical Algorithms / proposed algorithm / TERATOR algorithm / JAVA / triangle counting triangle algorithm / AMS algorithms / naive algorithm / one-pass algorithms / linear time algorithm / spectral counting algorithm / triangle counting algorithms / streaming algorithm / approximating algorithm / /

URL

http /

SocialTag