An Exon-Shuffling Genetic Algorithm for Degree-Constrained Minimum Spanning Tree

Authors

  • Sagar Jani M.E (C.E), L.D.C.E, Ahmedabad
  • D.A.Parikh Head, Computer Engineering Department, L.D.C.E, Ahmedabad

Keywords:

Degree-Constrained Minimum Spanning Tree, Exon-Shuffling Genetic Algorithm

Abstract

Degree-Constrained Minimum Spanning Tree is a NP-Hard problem which has been tried to solve using
different techniques to reduce its hardness. In this paper we have introduced a novel method to solve the problem of
degree constrained minimum spanning tree.

Downloads

Published

2016-06-25

Issue

Vol. 3 No. 6 (2016): Volume 3 Issue 6 June-2016

Section

Articles

How to Cite

An Exon-Shuffling Genetic Algorithm for Degree-Constrained Minimum Spanning Tree. (2016). International Journal of Advance Engineering and Research Development (IJAERD), 3(6), 243-247. https://ijaerd.org/index.php/IJAERD/article/view/1508

Similar Articles

1-10 of 1049

You may also start an advanced similarity search for this article.