85 search results - page 2 / 17 » New Streaming Algorithms for Counting Triangles in Graphs |
133
click to vote
CORR
2012
Springer
13 years 9 months ago
2012
Springer
Graphs and networks are used to model interactions in a variety of contexts, and there is a growing need to be able to quickly assess the qualities of a graph in order to understa...
131
click to vote
TCS
2008
15 years 1 months ago
2008
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
145
click to vote
SI3D
2003
ACM
15 years 7 months ago
2003
ACM
In this paper we develop an interactive 3D browser for large topographic maps using a visual display augmented by a haptic, or force feedback, display. The extreme size of our dat...
117
click to vote
DM
2008
15 years 1 months ago
2008
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
117
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...