Get all the updates for this publication
Journal Article
Open Access
An exact algorithm fork-cardinality degree constrained clustered minimum spanning tree problemOpen AccessPublished in IOP Publishing
2017
Volume: 263
Topics: Cardinality (SQL statements) (69)%69% related to the paper, Minimum spanning tree (65)%65% related to the paper, Degree (graph theory) (57)%57% related to the paper and Exact algorithm (53)%53% related to the paper
View more info for "An exact algorithm for k-cardinality degree constrained clustered minimum spanning tree problem"
Publisher Copy Version
Content may be subject to copyright.This is a gold open access article.This is a gold open access article.
About the journal
| Journal | Data powered by TypesetIOP Conference Series: Materials Science and Engineering |
|---|---|
| Publisher | Data powered by TypesetIOP Publishing |
| ISSN | 1757-8981 |
| Open Access | Yes |
Authors (1)
Purusotham S- 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
