GRAPH-SUBGRAPH ISOMORPHISM PROBLEM SOLVING FOR ORGANIZATION RESOURCES DISTRIBUTION
نویسندگان
چکیده
منابع مشابه
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 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...
متن کاملSolving Graph Isomorphism Problem for a Special case
Graph isomorphism is an important computer science problem. The problem for the general case is unknown to be in polynomial time. The bese algorithm for the general case works in quasi-polynomial time [1]. The solutions in polynomial time for some special type of classes are known. In this work, we have worked with a special type of graphs. We have proposed a method to represent these graphs an...
متن کاملThe Direct Algorithm for Solving of the Graph Isomorphism Problem
We propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially using the algorithm.
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Radio Electronics, Computer Science, Control
سال: 2014
ISSN: 2313-688X,1607-3274
DOI: 10.15588/1607-3274-2014-1-8