Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Spanning tree

Known as: Spanning tree (networks), Spanning Tree (mathematics), Spanning forest 
In the mathematical field of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
In this thesis we develop a discriminative learning method for dependency parsing using online large-margin training combined… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 2.2
Highly Cited
2001
Highly Cited
2001
This paper proves that the scaling limit of a loop-erased random walk in a simply connected domain \(D\mathop \subset \limits_… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 4.1
Highly Cited
2001
Highly Cited
2001
The paper considers the problem of covering a continuous planar area by a square-shaped tool attached to a mobile robot. Using a… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Highly Cited
1999
Highly Cited
1999
AbstractThe uniform spanning tree (UST) and the loop-erased random walk (LERW) are strongly related probabilistic processes. We… Expand
  • figure 1.1
  • figure 8.1
  • figure 10.1
Highly Cited
1991
Highly Cited
1991
Consider the nearest neighbor graph for the integer lattice Zd in d dimensions. For a large finite piece of it, consider choosing… Expand
Highly Cited
1990
Highly Cited
1990
  • D. Aldous
  • SIAM J. Discret. Math.
  • 1990
  • Corpus ID: 6993062
A random walk on a finite graph can be used to construct a uniform random spanning tree. It is shown how random walk techniques… Expand
Highly Cited
1989
Highly Cited
1989
  • A. Broder
  • 30th Annual Symposium on Foundations of Computer…
  • 1989
  • Corpus ID: 8057709
The author describes a probabilistic algorithm that, given a connected, undirected graph G with n vertices, produces a spanning… Expand
Highly Cited
1987
Highly Cited
1987
A NEW combinatorial formulation of the Jones polynomial of a link is used to establish some basic properties of this polynomial… Expand
  • figure 2
  • figure 3
  • figure 5
  • figure 6
  • table 1
Highly Cited
1981
Highly Cited
1981
We consider the problem of routing vehicles stationed at a central facility (depot) to supply customers with known demands, in… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1976
Highly Cited
1976
  • C. Bird
  • Networks
  • 1976
  • Corpus ID: 206312410
Cooperative game theory solution concepts are used to allocate costs in a spanning tree network. Stable cost allocations are… Expand