Extracting of All Maximal Cliques: Monotone System Approach
نویسنده
چکیده
NP-complicated problems have been described in the graph theory. An example is the extracting of all maximal cliques from a graph. Many algorithms for solving this problem have been described. However, complexity is linear to the number of maximal cliques. This paper discusses a new approach for extracting maximal cliques, based on the monotone system theory. The complexity of the presented algorithms is linear to the number of maximal cliques.
منابع مشابه
A SYSTEM OF GENERALIZED VARIATIONAL INCLUSIONS INVOLVING G-eta-MONOTONE MAPPINGS
We introduce a new concept of general $G$-$eta$-monotone operator generalizing the general $(H,eta)$-monotone operator cite{arvar2, arvar1}, general $H-$ monotone operator cite{xiahuang} in Banach spaces, and also generalizing $G$-$eta$-monotone operator cite{zhang}, $(A, eta)$-monotone operator cite{verma2}, $A$-monotone operator cite{verma0}, $(H, eta)$-monotone operator cite{fanghuang}...
متن کاملA game-theoretic approach to partial clique enumeration
In many computer vision and pattern recognition applications using graph-based representations, it is of great interest to be able to extract the k largest cliques in a graph. However, most methods are geared either towards extracting a single clique of maximum size, or enumerating all cliques, without following any particular order. In this paper, we present a novel approach for partial clique...
متن کاملMatching Free Trees, Maximal Cliques, and Monotone Game Dynamics
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association graph whose maximal cliques are in one-to-one correspondence with maximal common subtrees. We then solve the problem using simple payoff-monotonic dynamics from evolutionary game theory. We illustrate the power of the...
متن کاملCommon Zero Points of Two Finite Families of Maximal Monotone Operators via Proximal Point Algorithms
In this work, it is presented iterative schemes for achieving to common points of the solutions set of the system of generalized mixed equilibrium problems, solutions set of the variational inequality for an inverse-strongly monotone operator, common fixed points set of two infinite sequences of relatively nonexpansive mappings and common zero points set of two finite sequences of maximal monot...
متن کاملThe sum of two maximal monotone operator is of type FPV
In this paper, we studied maximal monotonicity of type FPV for sum of two maximal monotone operators of type FPV and the obtained results improve and complete the corresponding results of this filed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995