Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/61071
Title: Design and analysis of parallel algorithms for generalized matching problems on graphs
Researcher: Suganthi, G
Guide(s): Muga, S and Xavier, C
Keywords: Computational Model, Min-Sum Path Matching, Mm-Max Path Matching, Euler Circuits, Post Order Numberin
University: Manonmaniam Sundaranar University
Completed Date: 2003
Abstract: Abstract not available newline
Pagination: 220p.
URI: http://hdl.handle.net/10603/61071
Appears in Departments:Department of Computer Science & Engg.

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File255.42 kBAdobe PDFView/Open
02_certificate.pdf35.58 kBAdobe PDFView/Open
03_declaration.pdf32.74 kBAdobe PDFView/Open
04_acknowledgement.pdf64.42 kBAdobe PDFView/Open
05_contents.pdf75.22 kBAdobe PDFView/Open
06_chapter 1.pdf201.7 kBAdobe PDFView/Open
07_chapter 2.pdf620.76 kBAdobe PDFView/Open
08_chapter 3.pdf1.42 MBAdobe PDFView/Open
09_chapter 4.pdf592.02 kBAdobe PDFView/Open
10_chapter 5.pdf750.31 kBAdobe PDFView/Open
11_chapter 6.pdf920.67 kBAdobe PDFView/Open
12_chapter 7.pdf58.06 kBAdobe PDFView/Open
13_bibliography.pdf210.54 kBAdobe PDFView/Open


Items in Shodhganga are protected by copyright, with all rights reserved, unless otherwise indicated.