Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
79
An algorithm for subgraph isomorphism
- JOURNAL OF THE ACM
, 1976
"... Subgraph isomorphism can be determined by means of a brute-force tree-search enumeration procedure. In this paper a new algorithm is introduced that attains efficiency by inferentially eliminating successor nodes in the tree search. To assess the time actually taken by the new algorithm, subgraph is ..."
Abstract
-
Cited by 347 (1 self)
- Add to MetaCart
Subgraph isomorphism can be determined by means of a brute-force tree-search enumeration procedure. In this paper a new algorithm is introduced that attains efficiency by inferentially eliminating successor nodes in the tree search. To assess the time actually taken by the new algorithm, subgraph
Shape Cliques
, 2007
"... We introduce shape cliques, a simple way to organize a subset of the arrays appearing in an array-language-based application into sets of identically shaped arrays- shape cliques- and show how a compiler can analyze an application to infer membership in those cliques. We describe an algorithm for pe ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
for performing shape clique inference (SCI), and demonstrate that shape cliques can improve the performance of generated code, by permitting extension of an optimization for removal of run-time checks, and by extending the set of arrays to which optimizations, such as Index Vector Elimination (IVE), can
Register allocation via clique separators
- In Proceedings of the SIGPLAN '89 Conference on Programming Language Design and Implementation
, 1989
"... Abstract- Although graph coloring is widely recognized as an effective technique for global register allocation, the overhead can be quite high, not only in execution time but also in memory, as the size of the interference graph needed in coloring can become quite large. In this paper, we present a ..."
Abstract
-
Cited by 35 (4 self)
- Add to MetaCart
an algorithm based upon a result by R. Tarjan regarding the colorability of graphs which are decomposable using clique separators, that improves on the overhead of coloring. The algorithm first partitions program code into code segments using the notion of clique separators. The interference graphs
Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
, 1997
"... Let be a family of cliques of a graph G =(V,E). Suppose that each clique C of is associated with an integer r(C), where r(C) 0. A vertex vr-dominates a clique C of G if d(v, x) r(C) for all x C, where d(v, x) is the standard graph distance. A subset D V is a clique r-dominating set ..."
Abstract
-
Cited by 9 (1 self)
- Add to MetaCart
Let be a family of cliques of a graph G =(V,E). Suppose that each clique C of is associated with an integer r(C), where r(C) 0. A vertex vr-dominates a clique C of G if d(v, x) r(C) for all x C, where d(v, x) is the standard graph distance. A subset D V is a clique r-dominating set
A Fast Heuristic Algorithm Based on Verification and Elimination Methods for Maximum Clique Problem
"... A clique in an undirected graph G = (V, E) is a subset V ' ⊆ V of vertices, each pair of which is connected by an edge in E. The clique problem is an optimization problem of finding a clique of maximum size in graph. The clique problem is NP-Complete. We have succeeded in developing a fast alg ..."
Abstract
- Add to MetaCart
algorithm for maximum clique problem by employing the method of verification and elimination. For a graph of size N there are 2 N sub graphs, which may be cliques and hence verifying all of them, will take a long time. Idea is to eliminate a major number of sub graphs, which cannot be cliques and verifying
Fast Parallel Algorithms for the Clique Separator Decomposition
, 1990
"... We give an efficient NC algorithm for finding a clique separator decomposition of an arbitrary graph, that is, a series of cliques whose removal disconnects the graph. This algorithm allows one to extend a large body of results which were originally formulated for chordal graphs to other classes of ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
of the decomposition. These optimization problems include: finding a maximum-weight clique, a minimum coloring, a maximum-weight independent set, and a minimum fill-in elimination order. We also give the first parallel algorithms for solving these problems by using the clique separator decomposition. Our maximum
Moplex Elimination Orderings
- First Cologne-Twente Workshop on Graphs
, 2001
"... Classically, triangulated graphs are characterized and recognized by way of perfect elimination orderings (peo, which correspond to an elimination scheme on simplicial vertices). Algorithm LexBFS computes such a peo eciently, but is also useful for the enumeration of the minimal separators and maxim ..."
Abstract
-
Cited by 7 (5 self)
- Add to MetaCart
and maximal cliques, which means that the ordering it produces is special. We present an ordering which generalizes a LexBFS-type ordering, by eliminating at each step a set of simplicial vertices (called a moplex). This type of ordering actually characterizes triangulated graphs and easily yields
ANALYSIS OF CLIQUE BY MATRIX FACTORIZATION AND PARTITION METHODS
"... In real life clustering of high dimensional data is a big problem. To find out the dense regions from increasing dimensions is one of them. We have already studied the clustering techniques of low dimensional data sets like k-means, k-mediod, BIRCH, CLARANS, CURE, DBScan, PAM etc. If a region is den ..."
Abstract
- Add to MetaCart
is dense then it consists with number of data points with a minimum support of input parameter ø other wise it cannot take into clustering. So in this approach we have implemented CLIQUE to find out the clusters from multidimensional data sets. In dimension growth subspace clustering the clustering process
Higher-Order Clique Reduction Without Auxiliary Variables
"... We introduce a method to reduce most higher-order terms of Markov Random Fields with binary labels into lower-order ones without introducing any new variables, while keeping the minimizer of the energy unchanged. While the method does not reduce all terms, it can be used with existing techniques tha ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
that transforms arbitrary terms (by introducing auxiliary variables) and improve the speed. The method eliminates a higher-order term in the polynomial representation of the energy by finding the value assignment to the variables involved that cannot be part of a global minimizer and increasing the potential
A Clique Tree Algorithm For Partitioning A Chordal Graph Into Transitive Subgraphs
, 1994
"... . A partitioning problem on chordal graphs that arises in the solution of sparse triangular systems of equations on parallel computers is considered. Roughly the problem is to partition a chordal graph G into the fewest transitively orientable subgraphs over all perfect elimination orderings of G, ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
. A more efficient greedy scheme, obtained by representing the chordal graph in terms of its maximal cliques, is described here. The new greedy scheme eliminates in a specified order a largest set of "persistent leaves", a subset of the leaf cliques in the current graph, at each step
Results 1 - 10
of
79
