Generation of a random simple graph and its graphical presentation

  • Authors:

  • Krishnendu Basuli;Saptershi Naskar

  • Affiliations:

  • Department of Computer Science and Engineering, University of Calcutta, Kolkata, India;Department of Computer Science and Engineering, University of Calcutta, Kolkata, India

  • Venue:
  • Ubiquity
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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