An Improved Heuristic Method for Subgraph Isomorphism Problem
نویسندگان
چکیده
منابع مشابه
A Heuristic for the Subgraph Isomorphism Problem in Executing PROGRES
The work reported here is part of the PROGRES (PROgrammed Graph Rewriting Systems) project. PROGRES is a very high level multi paradigm language for the specification of complex structured data types and their operations. The data structures are modelled as directed, attributed, node and edge labelled graphs (diane graphs). The basic programming constructs of PROGRES are graph rewriting rules (...
متن کاملData Dependent Circuit for Subgraph Isomorphism Problem
The subgraph isomorphism problem has various important applications, although it is generally NP-complete and difficult to solve. This paper examines the feasibility of a data dependent circuit for the subgraph isomorphism problem, which is particularly suitable for FPGA implementation. For graphs of 32 vertices, the average logic scale of data dependent circuits is only 5% of the corresponding...
متن کاملAn Effective Approach for Solving Subgraph Isomorphism Problem
A novel and effective approach is presented in this paper for solving the wellknown difficult problem of subgraph isomorphism. By integrating planning strategies with the concept of centered spanning tree, the presented approach achieves an average-case, near-linear performance. A majority of practical subgraph isomorphism problems deals with the cases of labeled graphs, which contains the NPco...
متن کاملData Dependent Hardware for Subgraph Isomorphism Problem
Subgraph isomorphism problem has various important applications, while it is generally NP-complete and difficult to solve. Though Ullmann’s algorithm can be implemented by parallel hardware to accelerate the execution, it requires too much hardware to implement. This paper examines the feasibility of data dependent circuit for subgraph isomorphism problem. Logic gates are generally reducible if...
متن کاملAn Improved Satisfiable SAT Generator Based on Random Subgraph Isomorphism
We introduce Satisfiable Random High Degree Subgraph Isomorphism Generator(SRHD-SGI), a variation of the Satisfiable Random Subgraph Isomorphism Generator (SR-SGI). We use the direct encoding to translate the SRHD-SGI instances into Satisfiable SAT instances. We present empirical evidence that the new model preserves the main characteristics of SAT encoded SR-SGI: easy-hard-easy pattern of evol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOP Conference Series: Materials Science and Engineering
سال: 2017
ISSN: 1757-8981,1757-899X
DOI: 10.1088/1757-899x/231/1/012050