We study how to label the vertices of a tree in such a way that we can decide the distance of two vertices in the tree given only their labels. For trees, Gavoille et al. [7] prove...
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X ...
Leonid Khachiyan, Endre Boros, Konrad Borys, Khale...
Abstract. Logic languages establish a formal framework to solve authorization and delegation conflicts. However, we consider that a visual representation is necessary since graphs...
”Fluids” is an interactive and immersive mixed reality art installation that explores the relation of intimacy between reality and virtuality. We live in two different but con...
In this study we present a Y-feature extraction method for registering color and fluorescein angiograms of the retina. The registration of multimodal fluorescein imagery requires ...