We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
In this paper, we particularly focused our attention on how to enhance expressivity of ontologies when used as organized space values in a catalogue request process. Using the Wis...
This paper presents a new method for visualizing and navigating huge graphs. The main feature of this method is that it applies Level-Of-Detail (LOD) strategy to graph visualizati...