Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
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.
Ubiquity – Association for Computing Machinery
Published: Mar 1, 2008
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.