Cycle Packing in Complete Undirected Graph.
Date of Submission
December 1996
Date of Award
Winter 12-12-1997
Institute Name (Publisher)
Indian Statistical Institute
Document Type
Master's Dissertation
Degree Name
Master of Technology
Subject Name
Computer Science
Department
Applied Statistics Unit (ASU-Kolkata)
Supervisor
Roy, Bimal Kumar (ASU-Kolkata; ISI)
Abstract (Summary of the Work)
Packing of uniform 2-factors, (eristing of 4-cycles) in the complete undi- rected graph with n verter considered. For n = 4t, an algorithm is given which is considerably simpler than the ezisting algorithm. This case is modified to get 4t + 3, empirical result for n = 4t + 2. For the cases n = 4t + 1 and n %3D studies are done.
Control Number
ISI-DISS-1996-23
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.
DOI
http://dspace.isical.ac.in:8080/jspui/handle/10263/6198
Recommended Citation
Adak, Tapan Kumar, "Cycle Packing in Complete Undirected Graph." (1997). Master’s Dissertations. 58.
https://digitalcommons.isical.ac.in/masters-dissertations/58
Comments
ProQuest Collection ID: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:28843071