Profiles
Research Units
Publications
Sign Up
Faculty Login
X
Journal Article
Open Access
The degree constrained k-cardinality minimum spanning tree problem: a lexi-search algorithm
Kumar T.J
,
Purusotham S
Published in Growing Science
2018
DOI:
10.5267/j.dsl.2017.7.002
Pages: 301 - 310
Download
PDF
Publisher Copy
Cite
Publisher Copy Version
Content may be subject to copyright,
Check License
This is a gold open access article under cc-by license
This is a gold open access article under cc-by license
PDF
Figures & Tables (5)
References (16)
Journal Details
Authors (1)
About the journal
Journal
Data powered by Typeset
Decision Science Letters
Publisher
Data powered by Typeset
Growing Science
ISSN
1929-5804
Open Access
Yes
Authors (1)
Purusotham S
Department of Mathematics
School of Advanced Sciences
Vellore Campus
Recent publications
An exact algorithm fork-cardinality degree constrained clustered minimum spanning tree problem
An ISO/IEC 24745 compliant ECG template protection based on linear prediction coding
The problem of maximum flow with minimum attainable cost in a network
An Articulation Point-Based Approximation Algorithm for Minimum Vertex Cover Problem
Get all the updates for this publication
Follow