acm - an acm publication

Generation of a random simple graph and its graphical presentation

Ubiquity, Volume 2008 Issue March | BY Krishnendu Basuli , Saptershi Naskar 


Full citation in the ACM Digital Library

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].

Saptarshi Naskar and Krishendu Basuli of the University of Calcutta show you how to generate a random simple graph and its graphical presentation.

[Due to large amounts of code, this article is available as a PDF only.]

Source: Ubiquity Volume 9, Issue 10 (March 11, 2008 - March 17, 2008)



— krishnendu basuli, Fri, 16 Mar 2012 08:15:17 UTC

Leave this field empty