Results 171 to 180 of about 55,019 (192)

k-Subgraph Isomorphism on AC0 Circuits

computational complexity, 2009
Recently, Rossman [STOC '08] established a lower bound of $\omega(n^{k/4})$ on the size of constant-depth circuits for the $k$-clique function on $n$-vertex graphs, which is the first lower bound that does not depend on the depth of circuits in the exponent of $n$. He showed, in fact, a stronger statement: Suppose $f_n:\{0,1\}^{n \choose 2} \rightarrow
openaire   +2 more sources

An efficient genetic algorithm for subgraph isomorphism

Proceedings of the 14th annual conference on Genetic and evolutionary computation, 2012
In this paper we propose a multi-objective genetic algorithm for the subgraph isomorphism problem. Usually, the number of different edges between two graphs has been used as a fitness function. This approach has limitations in that it only considers directly-visible characteristics of current solutions, not considering the potential for being an ...
Jaeun Choi, Yourim Yoon, Byung Ro Moon
openaire   +1 more source

The Application Study of Subgraph Isomorphism in the SDMA

Mobile Networks and Applications, 2019
To meet the need for low delay of end-to-end data transmission in some particular application of mobile ad hoc network (MANET), the planning SDMA slot tables are usually adopted. Whether the message can be transmitted by the planning SDMA slot table must be judged to decide if the pattern topology graph according to the SDMA slot table is included in ...
Ruiya He, Kai Tao
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 ...
Shuichi Ichikawa, Lerdtanaseangtham Udorn, Kouji Konishi   +2 more
openaire   +1 more source

Search Strategies for Subgraph Isomorphism Algorithms

2014
Searching for subgraph isomorphisms is an essential problem in pattern matching. Most of the algorithms use a branch-and-bound method to sequentially assign pattern nodes to compatible nodes in the target graph. It is well known that the order in which nodes are assigned, a so-called search strategy, influences drastically the size of the search space.
Uros Cibej, Jurij Mihelic
openaire   +1 more source

Graphs with Isomorphic Subgraphs

Journal of the London Mathematical Society, 1972
Radjavi, Heydar, Rosenthal, Peter
openaire   +1 more source

The subgraph isomorphism problem

2013
This thesis describes the problem of finding subgraph isomorphism. This is one of the most basic operations performed on graphs and is an NP-hard problem. We describe in detail the Ullmann algorithm and VF2 algorithm, the most commonly used and state-of-the art algorithms in this field, and a new algorithm called Subsea.
openaire  

Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs

Proceedings of the VLDB Endowment, 2015
Junhu Wang, Xuguang Ren
exaly  

-based filtering for subgraph isomorphism

Artificial Intelligence, 2010
Christine Solnon
exaly  

Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs

Information Sciences, 2019
Shikha Anirban, Junhu Wang, Xuguang Ren
exaly