Results 1  10
of
37,196
A distributed algorithm for minimumweight spanning trees
, 1983
"... A distributed algorithm is presented that constructs he minimumweight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm and exchange ..."
Abstract

Cited by 432 (3 self)
 Add to MetaCart
A distributed algorithm is presented that constructs he minimumweight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm
An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1993
"... A novel graph theoretic approach for data clustering is presented and its application to the image segmentation problem is demonstrated. The data to be clustered are represented by an undirected adjacency graph G with arc capacities assigned to reflect the similarity between the linked vertices. Cl ..."
Abstract

Cited by 353 (0 self)
 Add to MetaCart
A novel graph theoretic approach for data clustering is presented and its application to the image segmentation problem is demonstrated. The data to be clustered are represented by an undirected adjacency graph G with arc capacities assigned to reflect the similarity between the linked vertices
Undirected Forest Constraints
 In CPAIOR’06, volume 3990 of LNCS
, 2006
"... Abstract. We present two constraints that partition the vertices of an undirected nvertex, medge graph G = (V, E) into a set of vertexdisjoint trees. The first is the resourceforest constraint, where we assume that a subset R ⊆ V of the vertices are resource vertices. The constraint specifies th ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. We present two constraints that partition the vertices of an undirected nvertex, medge graph G = (V, E) into a set of vertexdisjoint trees. The first is the resourceforest constraint, where we assume that a subset R ⊆ V of the vertices are resource vertices. The constraint specifies
Replicated softmax: an undirected topic model
 In Advances in Neural Information Processing Systems
"... We introduce a twolayer undirected graphical model, called a “Replicated Softmax”, that can be used to model and automatically extract lowdimensional latent semantic representations from a large unstructured collection of documents. We present efficient learning and inference algorithms for this m ..."
Abstract

Cited by 63 (14 self)
 Add to MetaCart
We introduce a twolayer undirected graphical model, called a “Replicated Softmax”, that can be used to model and automatically extract lowdimensional latent semantic representations from a large unstructured collection of documents. We present efficient learning and inference algorithms
Undirected Graphs of Entanglement 3
, 2009
"... Entanglement is a complexity measure of digraphs that origins in fixedpoint logics. Its combinatorial purpose is to measure the nested depth of cycles in digraphs. We address the problem of characterizing the structure of graphs of entanglement at most k. Only partial results are known so far: dig ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
: digraphs for k = 1, and undirected graphs for k = 2. In this paper we investigate the structure of undirected graphs for k = 3. Our main tool is the socalled Tutte’s decomposition of 2connected graphs into cycles and 3connected components into a treelike fashion. We shall give necessary conditions
A Faster Algorithm to Recognize Undirected Path Graphs
 Discrete Appl. Math
"... Let F be a finite family of nonempty sets. The undirected graph G is called the intersection graph of F if there is a bijection between the members of F and the vertices of G such that any two sets F i and F j (for i 6= j) have a nonempty intersection if and only if the corresponding vertices are a ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
are adjacent. We study intersection graphs where F is a family of undirected paths in an unrooted, undirected tree; these graphs are called (undirected) path graphs. They constitute a proper subclass of the chordal graphs. Gavril [Discr. Math. 23(1978), 211227] gave the first polynomial time algorithm
Dependency Parsing with Undirected Graphs
"... We introduce a new approach to transitionbased dependency parsing in which the parser does not directly construct a dependency structure, but rather an undirected graph, which is then converted into a directed dependency tree in a postprocessing step. This alleviates error propagation, since undire ..."
Abstract
 Add to MetaCart
We introduce a new approach to transitionbased dependency parsing in which the parser does not directly construct a dependency structure, but rather an undirected graph, which is then converted into a directed dependency tree in a postprocessing step. This alleviates error propagation, since
Undirected Graphical Models:
, 2003
"... th the corresponding separator set, C 1 2 . (But notice that these labels might not uniquely specify an edge.) A junction tree for a graph G is a clique tree for G that satisfies the following condition. For any cliques C 1 and C 2 in the tree, every clique on the path connecting C 1 and C 2 con ..."
Abstract
 Add to MetaCart
th the corresponding separator set, C 1 2 . (But notice that these labels might not uniquely specify an edge.) A junction tree for a graph G is a clique tree for G that satisfies the following condition. For any cliques C 1 and C 2 in the tree, every clique on the path connecting C 1 and C 2
Efficiently Scanning All Spanning Trees of an Undirected Graph
 J. Operation Research Society Japan
, 1993
"... : Let G be an undirected graph with V vertices and E edges. We consider the problem of enumerating all spanning trees of G: In order to explicitly output all spanning trees, the output size is of 2(NV ), where N is the number of spanning trees. This, however, can be compressed into 2(N) size. In thi ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
: Let G be an undirected graph with V vertices and E edges. We consider the problem of enumerating all spanning trees of G: In order to explicitly output all spanning trees, the output size is of 2(NV ), where N is the number of spanning trees. This, however, can be compressed into 2(N) size
Results 1  10
of
37,196