📄 IJAERD-OJS-1508
An Exon-Shuffling Genetic Algorithm for Degree-Constrained Minimum Spanning Tree
| Author(s) | : | Sagar Jani, D.A.Parikh |
| Institution | : | M.E (C.E), L.D.C.E, Ahmedabad |
| Published In | : | Vol. 3, Issue 6 — June 2016 |
| Page No. | : | 243-247 |
| Domain | : | Engineering |
| Type | : | Research Paper |
| ISSN (Online) | : | 2348-4470 |
| ISSN (Print) | : | 2348-6406 |
Abstract
Degree-Constrained Minimum Spanning Tree is a NP-Hard problem which has been tried to solve usingdifferent techniques to reduce its hardness. In this paper we have introduced a novel method to solve the problem ofdegree constrained minimum spanning tree.
🕮 How to Cite
Sagar Jani, D.A.Parikh, “An Exon-Shuffling Genetic Algorithm for Degree-Constrained Minimum Spanning Tree”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 3, Issue 6, pp. 243-247, June 2016.
Related Papers
Compact Tunable SIW Cavity Resonator Design for Ku-Band Applications
Hassan Al-Kuwari
