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.
2016
2016
Channel-aware routing and priority-aware multi-channel scheduling for WSN-based smart grid applications
Highly Cited
2011
Highly Cited
2011
Solving a modified consensus problem of linear multi-agent systems
2011
2011
An internal-model principle for the synchronisation of autonomous agents with individual dynamics
  • J. Lunze
  • IEEE Conference on Decision and Control and…
  • 2011
  • Corpus ID: 5925954
The task of synchronising autonomous agents is solved by a networked controller that steers the agents towards a common… 
2010
2010
Collaborative occupancy reasoning in visual sensor network for scalable smart video surveillance
Video surveillance is a popular consumer application that is used for various purposes such as public safety, facilities… 
Highly Cited
2008
Highly Cited
2008
Maximizing connected coverage via controlled actor relocation in wireless sensor and actor networks
2008
2008
Switching loss analysis of modulation methods used in cascaded H-bridge multilevel converters
Multilevel converters are used mainly in medium- voltage high-power applications. In this field, switching losses are an… 
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… 
1990
1990
Towards overcoming the transitive-closure bottleneck: efficient parallel algorithms for planar digraphs
Abstract There are linear-time sequential algorithms for many fundamental problems related to digraph reachability. In contrast… 
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)