Results 1  10
of
481
Distributed Maximal Clique Computation
"... Maximal cliques are important substructures in graph analysis. Many algorithms for computing maximal cliques have been proposed in the literature; however, most of them are sequential algorithms that cannot scale due to the high complexity of the problem, while existing parallel algorithms for comp ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Maximal cliques are important substructures in graph analysis. Many algorithms for computing maximal cliques have been proposed in the literature; however, most of them are sequential algorithms that cannot scale due to the high complexity of the problem, while existing parallel algorithms
INVARIANT MAXIMAL CLIQUES AND INCOMPLETENESS
, 2011
"... The Invariant Maximal Clique Theorem asserts that every graph on Q[0,n] k with a specific invariance condition has a maximal clique with another specific invariance condition. Here Q[0,n] consists of the rationals in the interval [0,n]. The invariance conditions are all given by equivalence relati ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The Invariant Maximal Clique Theorem asserts that every graph on Q[0,n] k with a specific invariance condition has a maximal clique with another specific invariance condition. Here Q[0,n] consists of the rationals in the interval [0,n]. The invariance conditions are all given by equivalence
Distributed Maximal Clique Computation and Management
, 2015
"... Maximal cliques are elementary substructures in a graph and instrumental in graph analysis such as the structural analysis of many complex networks, graph clustering and community detection, network hierarchy detection, emerging pattern mining, vertex importance measures, etc. However, the number o ..."
Abstract
 Add to MetaCart
Maximal cliques are elementary substructures in a graph and instrumental in graph analysis such as the structural analysis of many complex networks, graph clustering and community detection, network hierarchy detection, emerging pattern mining, vertex importance measures, etc. However, the number
Finding maximal cliques in massive networks
 ACM Trans. Database Syst
"... Maximal clique enumeration is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The problem is extensively studied; however, the best existing algorithms require memory space linear in the size of the input graph. T ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
Maximal clique enumeration is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The problem is extensively studied; however, the best existing algorithms require memory space linear in the size of the input graph
Stereo correspondence through feature grouping and maximal cliques
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1989
"... AbstractIn this paper we propose a method to solve the stereo correspondence problem. The method matches features and feature relationships and can be paraphrased as follows. Linear edge segments are extracted from both the left and right images. Each such segment is characterized by its position ..."
Abstract

Cited by 115 (0 self)
 Add to MetaCart
. Arcs in this graph represent compatible assignments established on the basis of segment relationships. Stereo matching becomes equivalent to searching for sets of mutually compatible nodes in this graph. These sets are found by looking for maximal cliques. The maximal clique the best suited to rep
ON CHARACTERIZING WEAKLY MAXIMAL CLIQUE IRREDUCIBLE GRAPHS
"... Abstract. The maximal clique that contains an edge which is not contained in any other maximal cliques is called essential. A graph in which each maximal clique is essential, or equivalently the set of all maximal cliques is a set of least number of maximal cliques that contains every edge, is said ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. The maximal clique that contains an edge which is not contained in any other maximal cliques is called essential. A graph in which each maximal clique is essential, or equivalently the set of all maximal cliques is a set of least number of maximal cliques that contains every edge
Extracting Of All Maximal Cliques: Monotone System Approach
, 1995
"... NPcomplicated 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 ext ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
NPcomplicated 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
Finding all maximal cliques in dynamic graphs
 Computational Optimization Appl
"... Clustering applications dealing with perception based or biased data lead to models with nondisjunct clusters. There, objects to be clustered are allowed to belong to several clusters at the same time which results in a fuzzy clustering. It can be shown that this is equivalent to searching all maxi ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
maximal cliques in dynamic graphs like Gt = (V;Et), where Et¡1 Et; t = 1; : : : ; T;E0 = Á. In this article algorithms are provided to track all maximal cliques in a fully dynamic graph. It is naturally to raise the question about the maximum clique, having all maximal cliques. Therefore this article
The Grötzsch Theorem for the hypergraph of maximal cliques
 Electron. J. Combin
, 1999
"... In this paper, we extend the Grotzsch Theorem by proving that the clique hypergraph of every planar graph is 3colorable. We also extend this result to list colorings by proving that for every planar or projective planar graph G. Finally, 4choosability is established for the class of loc ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
In this paper, we extend the Grotzsch Theorem by proving that the clique hypergraph of every planar graph is 3colorable. We also extend this result to list colorings by proving that for every planar or projective planar graph G. Finally, 4choosability is established for the class
Results 1  10
of
481