Algorithm to Find All Cliques in a Graph
نویسنده
چکیده
Algorithm to Find All Cliques in a Graph A. Ashok Kumar Department of Computer Science , St. Xavier’s College (Autonomous), Palayamkottai 627 002. E-mail: [email protected] S. Athisayanathan Research Department of Mathematics, St. Xavier’s College (Autonomous),Palayamkottai 627 002. E-mail: [email protected] A. Antonysamy Research Department of Mathematics, St. Xavier’s College (Autonomous),Palayamkottai 627 002. E-mail: [email protected]
منابع مشابه
Finding All Maximal Cliques of a Family of Induced Subgraphs
Many real world problems can be mapped onto graphs and solved with well-established efficient algorithms studied in graph theory. One such problem is the following: given a set of objects and an irreflexive and symmetric relation between these objects, find maximal subsets whose elements mutually satisfy this relation. This problem can be transformed to the problem of finding all cliques of an ...
متن کاملMaximal Cliques in Unit Disk Graphs: Polynomial Approximation
We consider the problem of generating all maximal cliques in an unit disk graph. General algorithms to find all maximal cliques are exponential, so we rely on a polynomial approximation. Our algorithm makes use of certain key geographic structures of these graphs. For each edge, we limit the set of vertices that may form cliques with this as the longest edge. We then consider several characteri...
متن کاملFinding Cliques of a Graph using Prime Numbers
This paper proposes a new algorithm for solving maximal cliques for simple undirected graphs using the theory of prime numbers. A novel approach using prime numbers is used to find cliques and ends with a discussion of the algorithm.
متن کاملA practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کامل8 F eb 2 01 2 Cliques in Odd - Minor - Free Graphs ∗
This paper is about: (1) bounds on the number of cliques in a graph in a particular class, and (2) algorithms for listing all cliques in a graph. We present a simple algorithm that lists all cliques in an n-vertex graph in O(n) time per clique. For O(1)-degenerate graphs, such as graphs excluding a fixed minor, we describe a O(n) time algorithm for listing all cliques. We prove that graphs excl...
متن کامل