Log in
Language:

MERAL Myanmar Education Research and Learning Portal

  • Top
  • Universities
  • Ranking
To
lat lon distance
To

Field does not validate



Index Link

Index Tree

Please input email address.

WEKO

One fine body…

WEKO

One fine body…

Item

{"_buckets": {"deposit": "520d2fdb-d445-4e35-bcec-de4885eba6d2"}, "_deposit": {"id": "3879", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "3879"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/3879", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Finding Minimum Spanning Tree", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "This paper studies the Minimum Spanning TreeMethods. A graph is a collection of nodes and edges, but has norules dictating the connection among the nodes. All trees aregraphs. A tree is a special case of graph in which all nodes arereachable from some starting node and one that has no cycles.There are typically many spanning tree in an undirected graphsuch that the sum of the lengths of tree’s edges is as small aspossible by using Kruskal’s Algorithm, Prim’s Algorithm andGenetic Algorithm, This system is implemented by usingMicrosoft Visual Studio C#2008."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value": []}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-08-02"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "Finding Minimum Spanning Tree.pdf", "filesize": [{"value": "10 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 10000.0, "url": {"url": "https://meral.edu.mm/record/3879/files/Finding Minimum Spanning Tree.pdf"}, "version_id": "6ba819d2-45b7-425e-a5cd-fcd02709ff9c"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Third Local Conference on Parallel and Soft Computing", "subitem_pages": "", "subitem_volume": ""}]}, "item_1583103147082": {"attribute_name": "Conference papers", "attribute_value_mlt": [{"subitem_acronym": "", "subitem_c_date": "", "subitem_conference_title": "", "subitem_part": "", "subitem_place": "", "subitem_session": "", "subitem_website": ""}]}, "item_1583103211336": {"attribute_name": "Books/reports/chapters", "attribute_value_mlt": [{"subitem_book_title": "", "subitem_isbn": "", "subitem_pages": "", "subitem_place": "", "subitem_publisher": ""}]}, "item_1583103233624": {"attribute_name": "Thesis/dissertations", "attribute_value_mlt": [{"subitem_awarding_university": "", "subitem_supervisor(s)": [{"subitem_supervisor": ""}]}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Htun, Sai Zaw Moe"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2009-08-03"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/1602"}, "item_title": "Finding Minimum Spanning Tree", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000003879", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-08-02"}, "publish_date": "2019-08-02", "publish_status": "0", "recid": "3879", "relation": {}, "relation_version_is_last": true, "title": ["Finding Minimum Spanning Tree"], "weko_shared_id": -1}
  1. University of Computer Studies, Yangon
  2. Conferences

Finding Minimum Spanning Tree

http://hdl.handle.net/20.500.12678/0000003879
http://hdl.handle.net/20.500.12678/0000003879
4015fb6a-5351-4583-ba16-35db9c76cc81
520d2fdb-d445-4e35-bcec-de4885eba6d2
None
Preview
Name / File License Actions
Finding Finding Minimum Spanning Tree.pdf (10 Kb)
Back
0
0
views
downloads
See details
Views Downloads

Versions

Ver.1 2020-09-01 13:44:26.930405
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Export

OAI-PMH
  • OAI-PMH DublinCore
Other Formats
  • JSON

Confirm


Back to MERAL


Back to MERAL