{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:36:39Z","timestamp":1750307799892,"version":"3.41.0"},"reference-count":6,"publisher":"Association for Computing Machinery (ACM)","issue":"March","license":[{"start":{"date-parts":[[2008,3,1]],"date-time":"2008-03-01T00:00:00Z","timestamp":1204329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Ubiquity"],"published-print":{"date-parts":[[2008,3]]},"abstract":"<jats:p>Most of the physical and mathematical problems can be formulated in terms of Graph Theory [1]. Generation of a single spanning tree for a simple, symmetric and connected graph G is well known polynomial time solvable problem [1]. Also there are some intractable problems like Graph Coloring, Vertex Connectivity, Isomorphism etc. in graph theory [2,3]. To solve these problems we need some Soft computing approaches like GA, SA, Fuzzy Set, Rough Set etc. [4,6].<\/jats:p>","DOI":"10.1145\/1366313.1361266","type":"journal-article","created":{"date-parts":[[2009,10,6]],"date-time":"2009-10-06T18:18:59Z","timestamp":1254853139000},"page":"1-4","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Generation of a random simple graph and its graphical presentation"],"prefix":"10.1145","volume":"2008","author":[{"given":"Krishnendu","family":"Basuli","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, University of Calcutta, Kolkata, India"}]},{"given":"Saptershi","family":"Naskar","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Calcutta, Kolkata, India"}]}],"member":"320","published-online":{"date-parts":[[2008,3,11]]},"reference":[{"volume-title":"PHI","year":"1977","author":"Algorithms Combinatorial","key":"e_1_2_1_1_1"},{"volume-title":"Freeman and Company","year":"1999","author":"Computer","key":"e_1_2_1_2_1"},{"key":"e_1_2_1_3_1","unstructured":"{3} Computer Architecture and Organization Hayes J. P. McGraw Hill 2nd Edition.  {3} Computer Architecture and Organization Hayes J. P. McGraw Hill 2nd Edition."},{"key":"e_1_2_1_4_1","unstructured":"{4} Data mining: Multimedia Soft Computing and Bio-informatics Susmita Mitra and Tinku Acharjye John Willey.  {4} Data mining: Multimedia Soft Computing and Bio-informatics Susmita Mitra and Tinku Acharjye John Willey."},{"key":"e_1_2_1_5_1","unstructured":"{5} Fundamental of Computer Algorithms Horowitz Sahani and Rajasekharan Galgotia Publication Pvt. Ltd. 2000.  {5} Fundamental of Computer Algorithms Horowitz Sahani and Rajasekharan Galgotia Publication Pvt. Ltd. 2000."},{"key":"e_1_2_1_6_1","unstructured":"{6} Modern Heuristic Technique for Combinatorial Problems Reeves C.R. John Wiley & Sons Inc. 1993.  {6} Modern Heuristic Technique for Combinatorial Problems Reeves C.R. John Wiley & Sons Inc. 1993."}],"container-title":["Ubiquity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1366313.1361266","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/ft_gateway.cfm?id=1361266&ftid=716209&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:30Z","timestamp":1750254990000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1366313.1361266"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3]]},"references-count":6,"journal-issue":{"issue":"March","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["10.1145\/1366313.1361266"],"URL":"https:\/\/doi.org\/10.1145\/1366313.1361266","relation":{},"ISSN":["1530-2180"],"issn-type":[{"type":"electronic","value":"1530-2180"}],"subject":[],"published":{"date-parts":[[2008,3]]},"assertion":[{"value":"2008-03-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}