—Due to the potential of enhancing traffic safety, protecting environment, and enabling new applications, vehicular communications, especially vehicle-to-vehicle (V2V) communica...
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
Francesco Bonchi, Aristides Gionis, Francesco Gull...
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
Hans L. Bodlaender, Arie M. C. A. Koster, Thomas W...
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...