Results 1  10
of
258,558
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 443 (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
Spanning Trees and Spanners
, 1996
"... We survey results in geometric network design theory, including algorithms for constructing minimum spanning trees and lowdilation graphs. ..."
Abstract

Cited by 149 (2 self)
 Add to MetaCart
We survey results in geometric network design theory, including algorithms for constructing minimum spanning trees and lowdilation graphs.
Optimum communication spanning trees
 SIAM J. Comput
, 1974
"... Abstract. Given a set of nodes N (i 1, 2,..., n) which may represent cities and a set of requirements ria which may represent the number of telephone calls between N and N j, the problem is to build a spanning tree connecting these n nodes such that the total cost of communication of the spanning tr ..."
Abstract

Cited by 90 (1 self)
 Add to MetaCart
Abstract. Given a set of nodes N (i 1, 2,..., n) which may represent cities and a set of requirements ria which may represent the number of telephone calls between N and N j, the problem is to build a spanning tree connecting these n nodes such that the total cost of communication of the spanning
Spanning Trees
, 2013
"... Given a MST, an immediate problem is how to get a new MST if a new vertex or certain new edges are added into the graph, or how to get a new MST if an existing vertex or certain existing edges are deleted from ..."
Abstract
 Add to MetaCart
Given a MST, an immediate problem is how to get a new MST if a new vertex or certain new edges are added into the graph, or how to get a new MST if an existing vertex or certain existing edges are deleted from
LowerStretch Spanning Trees
, 2005
"... ... as a subgraph a spanning tree into which the edges of G can be embedded with average stretch exp (O ( √ log n log log n)), and that there exists an nvertex graph G such that all its spanning trees have average stretch Ω(log n). Closing the exponential gap between these upper and lower bounds i ..."
Abstract

Cited by 84 (11 self)
 Add to MetaCart
... as a subgraph a spanning tree into which the edges of G can be embedded with average stretch exp (O ( √ log n log log n)), and that there exists an nvertex graph G such that all its spanning trees have average stretch Ω(log n). Closing the exponential gap between these upper and lower bounds
Minimum spanning tree algorithm
, 2010
"... An algorithm for minimum spanning tree [1] is discussed here. Apart from the traditional Kruskal‟s [2] and Prim‟s [3] algorithm for finding the minimum spanning tree, yet another algorithm for the same purpose is described here. Initially we form a forest and then we convert the forest into the mini ..."
Abstract
 Add to MetaCart
An algorithm for minimum spanning tree [1] is discussed here. Apart from the traditional Kruskal‟s [2] and Prim‟s [3] algorithm for finding the minimum spanning tree, yet another algorithm for the same purpose is described here. Initially we form a forest and then we convert the forest
Nonprojective dependency parsing using spanning tree algorithms
 In Proceedings of Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing
, 2005
"... We formalize weighted dependency parsing as searching for maximum spanning trees (MSTs) in directed graphs. Using this representation, the parsing algorithm of Eisner (1996) is sufficient for searching over all projective trees in O(n 3) time. More surprisingly, the representation is extended natura ..."
Abstract

Cited by 377 (10 self)
 Add to MetaCart
We formalize weighted dependency parsing as searching for maximum spanning trees (MSTs) in directed graphs. Using this representation, the parsing algorithm of Eisner (1996) is sufficient for searching over all projective trees in O(n 3) time. More surprisingly, the representation is extended
Spanning trees of small degree by
"... Abstract. In this paper we show that pseudorandom graphs contain spanning trees of maximum degree 3. More specifically, (n, d, λ)graphs with sufficiently large spectral gap contain such spanning trees. 1. ..."
Abstract
 Add to MetaCart
Abstract. In this paper we show that pseudorandom graphs contain spanning trees of maximum degree 3. More specifically, (n, d, λ)graphs with sufficiently large spectral gap contain such spanning trees. 1.
SPANNING TREES AND KHOVANOV HOMOLOGY
, 2008
"... The Jones polynomial can be expressed in terms of spanning trees of the graph obtained by checkerboard coloring a knot diagram. We show there exists a complex generated by these spanning trees whose homology is the reduced Khovanov homology. The spanning trees provide a filtration on the reduced K ..."
Abstract
 Add to MetaCart
The Jones polynomial can be expressed in terms of spanning trees of the graph obtained by checkerboard coloring a knot diagram. We show there exists a complex generated by these spanning trees whose homology is the reduced Khovanov homology. The spanning trees provide a filtration on the reduced
The number of spanning trees of finite
, 2006
"... We show that the number of spanning trees in the finite Sierpiński graph of level n is given by ..."
Abstract
 Add to MetaCart
We show that the number of spanning trees in the finite Sierpiński graph of level n is given by
Results 1  10
of
258,558