Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,146,977 papers from all fields of science
Search
Sign In
Create Free Account
Spanning tree
Known as:
Spanning tree (networks)
, Spanning Tree (mathematics)
, Spanning forest
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Abelian sandpile model
Augmented tree-based routing
Breadth-first search
Brooks' theorem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Greedy Embedding, Routing and Content Addressing for Darknets
Andreas Höfer
,
Stefanie Roos
,
T. Strufe
Conference on Networked Systems
2013
Corpus ID: 30878445
To achieve anonymous and censorship-resistant overlay communication, darknets restrict overlay links to trusted parties…
Expand
2010
2010
Tree Based Protocol for Key Management in Wireless Sensor Networks
Mohamed-Lamine Messai
,
M. Aliouat
,
H. Seba
EURASIP Journal on Wireless Communications and…
2010
Corpus ID: 14524451
Securing a wireless communication has generally a vital importance, particularly when this communication is in a hostile…
Expand
2010
2010
Some GPU Algorithms for Graph Connected Components and Spanning Tree
Jyothish Soman
,
Kishore Kothapalli
,
P J Narayanan
Parallel Processing Letters
2010
Corpus ID: 15910639
Graphics Processing Units (GPU) are application specific accelerators which provide high performance to cost ratio and are widely…
Expand
2006
2006
Combining Czech Dependency Parsers
Tomás Holan
,
Z. Žabokrtský
International Conference on Text, Speech and…
2006
Corpus ID: 14370282
In this paper we describe in detail two dependency parsing techniques developed and evaluated using the Prague Dependency…
Expand
2006
2006
Rooted Tree and Spanning Tree Constraints
P. Prosser
,
Chris Unsworth
2006
Corpus ID: 8648875
We present two specialised constraints for modelling trees. The first constrains a set of variables, such that each variable…
Expand
2005
2005
Why ethernet WAN transport?
A. Meddeb
IEEE Communications Magazine
2005
Corpus ID: 34973234
The ubiquitous and plug-and-play characteristics of Ethernet provide a unique opportunity for service providers to-offer a…
Expand
Highly Cited
2004
Highly Cited
2004
Reference current estimation under distorted line voltage for control of shunt active power filters
V. Moreno
,
A. López
,
Ramón Ignacio Diego Garcías
IEEE transactions on power electronics
2004
Corpus ID: 24928933
Shunt active power filters (APF) are used in power systems for the compensation of harmonic currents generated for non linear…
Expand
2001
2001
A WORK AVAILABILITY PERSPECTIVE OF TURBOFAN ENGINE PERFORMANCE
B. Roth
,
D. Mavris
2001
Corpus ID: 16753000
Presented at the 39th AIAA, Aerospace Sciences Meeting and Exhibit, Reno, NV, January 9-11, 2001.
Highly Cited
2000
Highly Cited
2000
Improving the Up ∗ /Down ∗ Routing Scheme for Networks of Workstations (cid:1)
J. Sancho
,
A. Robles
2000
Corpus ID: 27872345
. Networks of workstations (NOWs) are being considered as a cost-effective alternative to parallel computers. Many NOWs are…
Expand
1986
1986
On Partially Ordered Graph Grammars
F. Brandenburg
Graph-Grammars and Their Application to Computer…
1986
Corpus ID: 36316594
Graph grammars are systems for the generation of directed, node and edge labeled graphs. They rewrite single nodes only and…
Expand