Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlo...
Abstract. Reasoning about social networks (labeled, directed, weighted graphs) is becoming increasingly important and there are now models of how certain phenomena (e.g. adoption o...
Paulo Shakarian, V. S. Subrahmanian, Maria Luisa S...
Fox Finding Objects of eXperiments is the declarative query language for Moose Modeling Objects Of Scienti c Experiments, an object-oriented data model at the core of a scient...
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...