Krishnendu Basuli
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].
- {1} Combinatorial Algorithms: Theory and Practice, Reingold, Nievergelt and Deo, PHI, 1977. Google Scholar
Digital Library
- {2} Computer and Intractability - A guide to the Theory of NP Completeness, Garry and Johnson, W.H. Freeman and Company, 1999.Google Scholar
- {3} Computer Architecture and Organization, Hayes J. P., McGraw Hill, 2nd Edition.Google Scholar
- {4} Data mining: Multimedia, Soft Computing and Bio-informatics, Susmita Mitra and Tinku Acharjye, John Willey.Google Scholar
- {5} Fundamental of Computer Algorithms, Horowitz, Sahani and Rajasekharan, Galgotia Publication Pvt. Ltd., 2000.Google Scholar
- {6} Modern Heuristic Technique for Combinatorial Problems, Reeves C.R., John Wiley & Sons, Inc., 1993.Google Scholar
Index Terms
- Generation of a random simple graph and its graphical presentation
Recommendations
The random planar graph process
We consider the following variant of the classical random graph process introduced by Erdýs and Rényi. Starting with an empty graph on n vertices, choose the next edge uniformly at random among all edges not yet considered, but only insert it if the ...
On the generation of bicliques of a graph
An independent set of a graph is a subset of pairwise non-adjacent vertices. A complete bipartite set B is a subset of vertices admitting a bipartition B=X∪Y, such that both X and Y are independent sets, and all vertices of X are adjacent to those of Y. If ...
Regular induced subgraphs of a random Graph
An old problem of Erdős, Fajtlowicz, and Staton asks for the order of a largest induced regular subgraph that can be found in every graph on <span>$n$ **image** </span> vertices. Motivated by this problem, we consider the order of such a subgraph in a ...
Comments