This technical report describes the XML data integration framework being built within the AutoMed heterogeneous data integration system. It presents a description of the overall f...
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3], after having proved...
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadh...
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...
The eccentric digraph ED(G) of a digraph G represents the binary relation, defined on the vertex set of G, of being `eccentric'; that is, there is an arc from u to v in ED(G)...