• # GENREG

• Referenced in 51 articles [sw26671]
• regular graphs up to isomorphism is one of the oldest problems in constructive combinatorics ... orderly generation refined by criteria to avoid isomorphism checking and combined with a fast test...
• # VF2++

• Referenced in 1 article [sw23880]
• algorithm for the Subgraph Isomorphism Problem. The improvements are twofold. Firstly, it is based ... addition to the usual Subgraph Isomorphism Problem, the paper also presents specialized algorithms ... Subgraph Isomorphism and for the Graph Isomorphism Problems. Finally, an extensive experimental evaluation is provided...
• # Fg-index

• Referenced in 9 articles [sw18892]
• involves subgraph isomorphism testing, which is an NP-complete problem. In recent years, some effective ... verification on each candidate by checking subgraph isomorphism. Query performance is improved since the number...
• # GString

• Referenced in 4 articles [sw18900]
• finding an efficient solution to the problem is essential for many applications. A popular approach ... complexities arising from graph isomorphism and other problems in searching. In this paper, we introduce...
• # SING

• Referenced in 5 articles [sw18904]
• image understanding. Since subgraph isomorphism is a computationally hard problem, indexing techniques have been intensively ... contain the query, and apply a subgraph isomorphism algorithm to each residual candidate graph...
• # GameShrink

• Referenced in 11 articles [sw12511]
• game of imperfect information is a fundamental problem in computational game theory, but current techniques ... address this, we introduce the ordered game isomorphism and the related ordered game isomorphic abstraction...
• # GEM++

• Referenced in 0 articles [sw34184]
• tolerant subgraph isomorphism. The substitution-tolerant subgraph isomorphism is a particular error-tolerant subgraph matching ... solving this class of graph matching problem. The paper also presents GEM++, a software framework ... allows the processing of different sub-problems (induced isomorphism or not, directed graphs...
• # FALCON

• Referenced in 7 articles [sw21349]
• models is viewed as a constraint satisfaction problem, with ground instances of the axioms ... called the least number heuristic, to eliminate isomorphic (partial) models, thus reducing the size...
• # GraphState

• Referenced in 2 articles [sw21498]
• graph representation gives an efficient way for isomorphism finding, searching for subgraphs and other graph ... might be useful for more general graph problems...
• # SyncSpecCnn

• Referenced in 4 articles [sw26163]
• Segmentation. In this paper, we study the problem of semantic annotation on 3D models that ... grids, shape graphs are irregular and non-isomorphic data structures. To enable the prediction...
• # FL-GrCCA

• Referenced in 4 articles [sw00296]
• positive valuation function, namely $\arctan$, and an isomorphic mapping between lattices. Changeable classification granules ... classifier, for a number of two-class problems and multi-class problems. Our computational experiments...
• # ParMol

• Referenced in 1 article [sw15010]
• last years. Algorithms to solve this problem are used in chemoinformatics to find common molecular ... graph structures includes costly graph and subgraph isomorphism tests . In our ParMol package we have...
• # galeDuality

• Referenced in 1 article [sw18222]
• with `few’ mo’nomials’. A scheme-theoretic isomorphism exists between the positive solutions ... arbitrary and to design new algorithms as problems are encountered during the development...