Donor-Recipient Matching in Bipartite Graph Using Enhanced DRMLT Algorithm for Liver Transplantation

Article Sidebar

Number of D-R Matching
PDF
Published: Mar 10, 2023
Keywords:
Datasets Bipartite Graph MELD Score DRMLT algorithm

Main Article Content

M. Usha Devi
Research Scholar, PG and Research Department of Computer Science, Department of Computer Science, Government Arts College, Coimbatore, Tamilnadu, India
A. Marimuthu
Associate Professor & Head, Department of Computer Science, Government Arts and Science College, Mettupalayam-04, India
N. Thenmozhi
Assistant Professor, Department of Computer Science and Information Technology, Government Arts College, Coimbatore-18, India
S. Santhana Megala
Assistant Professor, School of Computer Studies, RVS College of Arts and Science, Coimbatore, India.

Abstract

The matching preference for the liver transplanatation is taken from MELD Score which is more important between D-R(Donor to Recipient) using bipartite graph .In order to support the medical system or to help for the chronic failure. The characteristics of both donor to recipient features or parameters plays an important role.The final stage of the liver patient is chronic failure then necessity of the liver transplantation.The prediction of donor-recipient matching and the method is correlation to identifies exact donor- recipient matching. The correlation techniques shows the complete analysis of D-R matching for liver transplantation. To predict the long term survival of liver patients after liver transplanation based on the Donor-Recipient matching using the Bipartite graph method. To propose an efficient algorithm to collect the number of matching with minimum computation using DRMLT algorithm.

Article Details

How to Cite
Devi, M. U. ., Marimuthu, A. ., Thenmozhi, N. ., & Megala, S. S. . (2023). Donor-Recipient Matching in Bipartite Graph Using Enhanced DRMLT Algorithm for Liver Transplantation. Journal of Coastal Life Medicine, 11(1), 831–836. Retrieved from https://www.jclmm.com/index.php/journal/article/view/436
Issue
Vol. 11: Number 1, 2023
Section
Articles

References

D. Gale and L.S. Shapley. College admissions and the stability of marriage. American Mathematical Monthly, 69(1962), pp 9-15.

Robert W. Irving An Efficient Algorithm for the Stable Roommates Problem, Journal of Algorithms 6(1985), 577-595.

D. Gusfield. The structure of the stable roommate problem-efficient representation and enumeration of all stable assignments. SIAM Journal of computing, 17(4):742-769, 1988.

T. Ramachandran, K. Velusamy and T. Selvakumar Satisfactory Roommates problem. International journal of 36Mathematical Archives.2 (9), 2011, 1679-1682.

Ismel Brito and Pedro Meseguer, Distributed Stable Marriage Problem, Principles and Practice of Constraint Programming - CP 2005 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005. Proceedings.

Matching(graph-theory) Wikipediahttps://en.wikipedia.org/wiki/Matching (graph_theory)

https://towards data science. com/matching-of-bipartite- graphs-using- networkx- 6d355b164567.

Matching in Bipartite Graphs- https://discrete.openmathbiiks.org/ dmoi3/sec_matchings.html.

Matching (Graph Theory) | Brilliant Math & Science Wiki -https://brilliant.org/wiki/matching/.

Networkx.algorithms.bipartite.matching – NetworkX 2.5.