Finding Degree Constrained k-Cardinality Minimum Spanning Trees for Wireless Sensor Networks
Abstract
In this paper, we consider the degree constrained k-cardinality minimum spanning tree network problem (k-DCMST). This problem arises as a combination of two classical optimization problems, namely the degree constrained and k-minimum spanning tree problems (Resp. DCMST and k-MST). Let G(V, E) be a connected undirected graph formed with vertex and edge sets V and E, respectively. The DCMST problem asks for a minimum spanning tree where each...
Paper Details
Title
Finding Degree Constrained k-Cardinality Minimum Spanning Trees for Wireless Sensor Networks
Published Date
Aug 6, 2018
Pages
51 - 62
Citation AnalysisPro
You’ll need to upgrade your plan to Pro
Looking to understand the true influence of a researcher’s work across journals & affiliations?
- Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
- Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.
Notes
History