Results 141 to 150 of about 17,360 (200)
Jackalope Plus tool for post-coordination, ontology development, and precise mapping in observational health studies. [PDF]
Sci RepTrofymenko M +8 more
europepmc +1 more source
Hybrid Grid Pattern Star Identification Algorithm Based on Multi-Calibration Star Verification. [PDF]
Sensors (Basel)Shen C, Ma C, Gao W, Wang Y.
europepmc +1 more source
Heuristic sampling for the subgraph isomorphism problem
2017 IEEE 14th International Scientific Conference on Informatics, 2017 Subgraph isomorphism is one of the fundamental search problems in computer science. In this article we consider the counting variation of this problem. The task is to count all instances of the pattern G occurring in a (usually larger) graph H. All algorithms for this problem use a variation of backtracking. Most commonly they assign one vertex of G to
Uros Cibej, Jurij Mihelic
openaire +2 more sources
A Backtracking Algorithmic Toolbox for Solving the Subgraph Isomorphism Problem
, 2021 The subgraph isomorphism problem asks whether a given graph is a subgraph of another graph. It is one of the most general NP-complete problems since many other problems (e.g., Hamiltonian cycle, clique, independent set, etc.) have a natural reduction to subgraph isomorphism.
Jurij Mihelič +2 more
openaire +2 more sources
Hardware accelerator for subgraph isomorphism problems
Proceedings 2000 IEEE Symposium on Field-Programmable Custom Computing Machines (Cat. No.PR00871), 2002 Many applications can be modeled as subgraph isomorphism problems, which are generally NP-complete. This paper presents an algorithm that is suited for hardware implementation. The prototype accelerator that operates at 16.5 MHz on a Lucent ORCA 2C15A FPGA outperforms the software implementation of Ullmann's algorithm on a 400 MHz Pentium II by 10 ...
S. Ichikawa, L. Udorn, K. Konishi
openaire +2 more sources
Developing Heuristic for Subgraph Isomorphism Problem
, 2012 Subgraph isomorphism problem is an NP-hard problem and the available algorithms are of exponential time complexity. Hence these are not efficient for real world applications. A number of heuristic methods are proposed in the literature in this field. Ullmann[6] proposed a solution for subgraph isomorphism problem in 1976, which is being referred till ...
Saifuddin Kaijar, S. Durga Bhavani
openaire +2 more sources
Solving the Subgraph Isomorphism Problem Using Harmony Search
, 2017 The active usage of open source software contributes many areas. However, there are many problems like ignoring license or intellectual properties infringement which can lead litigation. In this paper, we try to find original open source software by using similarity of source code.
Hoyeong Yun +4 more
openaire +2 more sources
Reductions between the Subgraph Isomorphism Problem and Hamiltonian and SAT Problems
17th International Conference on Electronics, Communications and Computers (CONIELECOMP'07), 2007 Subgraph isomorphism (SI) detection is an important problem for several computer science subfields. In this paper we present a study of the subgraph isomorphism problem (SIP) and its relation with the Hamiltonian cycles and SAT problems. In particular, we describe how instances of those problems can be solved throughout SI detection (using problems ...
Ivan Olmos +2 more
openaire +2 more sources