Let 𝑅 be any subring of the reals. We present a generalization of linear systems on graphs where divisors are 𝑅-valued functions on the set of vertices and graph edges are permitted to have ...
Estimating the number of triangles in a graph is a fundamental problem and has found applications in many fields. This problem has been widely studied in the context of graph stream processing.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results