Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Abelian sandpile modelAugmented tree-based routingBreadth-first searchBrooks' theorem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Three-dimensional circular formations via set stabilization
Highly Cited
2013
Highly Cited
2013
Capacity and Delay Analysis for Data Gathering with Compressive Sensing in Wireless Sensor Networks
Compressive sensing (CS) provides a new paradigm for efficient data gathering in wireless sensor networks (WSNs). In this paper… 
2012
2012
Adaptive routing for multihop IEEE 802.15.6 Wireless Body Area Networks
Wireless Body Area Networks (BANs) have the ability of gathering and sending on-body measurements to a terminal. Autonomous nodes… 
Highly Cited
2011
Highly Cited
2011
Solving a modified consensus problem of linear multi-agent systems
Highly Cited
2008
Highly Cited
2008
Maximizing connected coverage via controlled actor relocation in wireless sensor and actor networks
2006
2006
Improved Heuristics for the Minimum Label Spanning Tree Problem
Given a connected, undirected graph G whose edges are labeled, the minimum label (or labeling) spanning tree (MLST) problem seeks… 
2005
2005
Why ethernet WAN transport?
The ubiquitous and plug-and-play characteristics of Ethernet provide a unique opportunity for service providers to-offer a… 
Highly Cited
2004
Highly Cited
2004
Reference current estimation under distorted line voltage for control of shunt active power filters
Shunt active power filters (APF) are used in power systems for the compensation of harmonic currents generated for non linear… 
Highly Cited
2000
Highly Cited
2000
Improving the Up ∗ /Down ∗ Routing Scheme for Networks of Workstations (cid:1)
. Networks of workstations (NOWs) are being considered as a cost-effective alternative to parallel computers. Many NOWs are… 
Highly Cited
1977
Highly Cited
1977
Minimal ratio spanning trees
Given an undirected graph G: (N;E) with a node set N and an edge set E and numbers Ce and De, e ϵ E, we provide a polynominally… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)