Reingold, Vadhan and Wigderson [21] introduced the graph zig-zag product. This product combines a large graph and a small graph into one graph, such that the resulting graph inher...
Given a graph on n vertices which is the union of two comparability graphs on the same vertex set, it always contains a clique or independent set of size n 1 3 . On the other hand...
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...
Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreve...
Mining, discovering, and integrating process-oriented services has attracted growing attention in the recent year. Workflow precedence graph and workflow block structures are two i...
Recently, spectral clustering (a.k.a. normalized graph cut) techniques have become popular for their potential ability at finding irregularlyshaped clusters in data. The input to...