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.
2010
2010
Securing a wireless communication has generally a vital importance, particularly when this communication is in a hostile… 
2010
2010
Graphics Processing Units (GPU) are application specific accelerators which provide high performance to cost ratio and are widely… 
2009
2009
Ethernet is becoming a preferred technology to be deployed in metro domain due to its low cost, simplicity and ubiquity. However… 
2006
2006
We present two specialised constraints for modelling trees. The first constrains a set of variables, such that each variable… 
2005
2005
The ubiquitous and plug-and-play characteristics of Ethernet provide a unique opportunity for service providers to-offer a… 
2005
2005
We give a new algebraic representation for the wrap-around butterfly interconnection network. This new representation is based on… 
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… 
2002
2002
We consider the task of assembling a large number of self controlled parts (or robots) into copies of a prescribed assembly (or… 
2002
2002
This paper introduces the neuRFon/spl trade/ Netform, a self-organizing wireless network for low data rate, low-power fixed… 
1986
1986
  • F. Brandenburg
  • 1986
  • Corpus ID: 36316594
Graph grammars are systems for the generation of directed, node and edge labeled graphs. They rewrite single nodes only and…