A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. The clique...
Flavia Bonomo, Maria Chudnovsky, Guillermo Dur&aac...
We propose a novel formulation of stereo matching that considers each pixel as a feature vector. Under this view, matching two or more images can be cast as matching point clouds i...
We present a graphical semantics for the pi-calculus, that is easier to visualize and better suited to expressing causality and temporal properties than conventional relational se...
Exception analyses so far cannot provide information on the propagation of thrown exceptions, which is necessary to construct interprocedural control flow graph, visualize exceptio...
A block graph is a graph whose blocks are cliques. A block duplicate (BD) graph is a graph obtained by adding true twins (i.e., adjacent vertices with the same closed neighborhood...