232 search results - page 2 / 47 » Dynamic Graph Clustering Using Minimum-Cut Trees |
110
click to vote
NIPS
2007
15 years 1 months ago
2007
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 ...
111
click to vote
EDBT
2012
ACM
13 years 2 months ago
2012
ACM
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...
104
click to vote
SIAMCOMP
2010
14 years 10 months ago
2010
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...
WEBI
2004
Springer
15 years 5 months ago
2004
Springer
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...
103
click to vote
APWEB
2005
Springer
15 years 5 months ago
2005
Springer
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...