Skip to main navigation
Skip to search
Skip to main content
University of Haifa Home
Update your profile
Link opens in a new tab
Search content at University of Haifa
Home
Researchers
Research units
Research output
Approximately counting triangles in sublinear time
Talya Eden
,
Amit Levi
, Dana Ron
, C. Seshadhr
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Approximately counting triangles in sublinear time'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Sublinear Time
100%
Number of Triangles
100%
Number of Edges
66%
Query Complexity
66%
Expected Running Time
66%
Number of Vertices
33%
Existing Algorithms
33%
Sublinear Algorithms
33%
Vertex Pair
33%
Entire Graphs
33%
Algorithm Complexity
33%
Neighbor Query
33%
Approximation Parameters
33%
Computer Science
Approximation (Algorithm)
100%
Constant Probability
100%