Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query graph, from a large set of graphs. Considering the problem of testing subgraph isomorphism is generally NP-hard, most of the existing techniques are based on the framework of filtering-and-verification to reduce the p...

In this study we discuss about an application of fuzzy graph isomorphism. If we look two unequal fuzzy matrices on undirected fuzzy graphs, we cannot say either the fuzzy graphs of theses fuzzy matrices are isomorphic or not isomorphic. It is because two fuzzy matrices may look different even if the fuzzy graphs are isomorphic. In this study, by using the algorithm for fuzzy graph isomorphism i...

Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edges. However, there are a number of applications that lead to graphs that do not share these characteristics, for which these algorithms highly become inefficient. In this paper we propose a fast algorithm for mining f...

Abstract. We present an O(V 4 log V ) coin flipping algorithm to test vertex-colored graphs with bounded color multiplicities for color-preserving isomorphism. We are also able to generate uniformly distributed random automorphisms of such graphs. A more general result finds generators for the intersection of cylindric subgroups of a direct product of groups in O(n7/2 log n) time, where n is th...

The Graph Isomorphism problem has both theoretical and practical interest. In this paper we present an algorithm, called conauto-1.2, that efficiently tests whether two graphs are isomorphic, and finds an isomorphism if they are. This algorithm is an improved version of the algorithm conauto, which has been shown to be very fast for random graphs and several families of hard graphs [9]. In this...

For a given block design D, we consider two isomorphism invariants, the eccentric sequences and the triangle sequences of some special graphs of D. Among other results we show that these invariants can often be used effectively, as far as computational complexity is concerned, in isomorphism testing of designs. Several unsolved problems are also proposed.