Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/133277
Title: Designing algorithms for graphs_ centrality with respect to cliques
Researcher: Ashok Kumar, A
Guide(s): Antonysamy, A
Keywords: Designing algorithms, Graphs, Centrality, Vertex-to-clique center, Parallel algorithms
University: Manonmaniam Sundaranar University
Completed Date: 2008
Abstract: newline Abstract not available newline
Pagination: ix, 144p.
URI: http://hdl.handle.net/10603/133277
Appears in Departments:Department of Computer Science & Engg.

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File26.69 kBAdobe PDFView/Open
02_certificate.pdf288.03 kBAdobe PDFView/Open
03_declaration.pdf33.7 kBAdobe PDFView/Open
04_acknowledgement.pdf47.33 kBAdobe PDFView/Open
05_contents.pdf43.27 kBAdobe PDFView/Open
06_abstract.pdf41.57 kBAdobe PDFView/Open
07_preface.pdf92.87 kBAdobe PDFView/Open
08_chapter 1.pdf435.32 kBAdobe PDFView/Open
09_chapter 2.pdf93.06 kBAdobe PDFView/Open
10_chapter 3.pdf432.84 kBAdobe PDFView/Open
11_chapter 4.pdf856.9 kBAdobe PDFView/Open
12_chapter 5.pdf517.24 kBAdobe PDFView/Open
13_chapter 6.pdf569.91 kBAdobe PDFView/Open
14_chapter 7.pdf495.07 kBAdobe PDFView/Open
15_chapter 8.pdf315.92 kBAdobe PDFView/Open
16_chapter 9.pdf109.28 kBAdobe PDFView/Open
17_chapter 10.pdf49.23 kBAdobe PDFView/Open
18_references.pdf71.17 kBAdobe PDFView/Open


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