Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Generation of a random simple graph and its graphical presentation

Generation of a random simple graph and its graphical presentation 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Ubiquity Association for Computing Machinery

Generation of a random simple graph and its graphical presentation

Ubiquity , Volume 2008 (March) – Mar 1, 2008

Loading next page...
 
/lp/association-for-computing-machinery/generation-of-a-random-simple-graph-and-its-graphical-presentation-o6XQq02i2g

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc.
Subject
Graphical user interfaces (GUI)
ISSN
1530-2180
DOI
10.1145/1361264.1361266
Publisher site
See Article on Publisher Site

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.

Journal

UbiquityAssociation for Computing Machinery

Published: Mar 1, 2008

There are no references for this article.