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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
2011
2011
  • J. Lunze
  • 2011
  • Corpus ID: 5925954
The task of synchronising autonomous agents is solved by a networked controller that steers the agents towards a common… 
2008
2008
Multilevel converters are used mainly in medium- voltage high-power applications. In this field, switching losses are an… 
2005
2005
The ubiquitous and plug-and-play characteristics of Ethernet provide a unique opportunity for service providers to-offer a… 
Highly Cited
2005
Highly Cited
2005
This paper proposes a novel and simple positive sequence detector (PSD), which is inherently self-adjustable to fundamental… 
Highly Cited
2004
Highly Cited
2004
Shunt active power filters (APF) are used in power systems for the compensation of harmonic currents generated for non linear… 
2004
2004
Rolling a ball on a plane is a standard example of nonholonomy reported in many textbooks, and the problem is also well… 
Highly Cited
1977
Highly Cited
1977
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…