85 search results - page 8 / 17 » New Streaming Algorithms for Counting Triangles in Graphs |
EJC
2008
14 years 11 months ago
2008
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
107
click to vote
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
111
click to vote
AMAI
2004
Springer
15 years 5 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
TCBB
2011
14 years 6 months ago
2011
A TOPS diagram is a simplified description of the topology of a protein using a graph where nodes are α-helices and β-strands, and edges correspond to chirality relations and p...
102
click to vote
SIGKDD
2008
14 years 11 months ago
2008
Incremental pattern discovery targets streaming applications where the data continuously arrive incrementally. The questions are how to find patterns (main trends) incrementally; ...