H Rong, T Ma, M Tang, J Cao - Soft Computing, 2018 - Springer
In this paper, we propose a novel K^+ K+-isomorphism method to achieve K-anonymization state among subgraphs or detected communities in a given social network. Our proposed …
Most of the theoretical studies on polymer kinetics has been performed by manually reducing the chemical system to a few simple reaction mechanisms having a repeatable …
Graphs are widely used to model complicated data semantics in many application domains. Subgraph isomorphism checking (an NP-complete problem) is a regular operation with this …
D Šenkýř, P Kroha - International Conference on Advanced Information …, 2021 - Springer
In this paper, we describe our graph-oriented method used to find semantically similar sentences in external information sources that have a semantic enrichment potential in …
The Maximum Common Substructure (MCS), along with numerous graph theory techniques, has been used widely in chemoinformatics. A topic which has been studied at Sheffield is …
F Coelho, E Alves, J Arias-Garcia… - 2021 5th International …, 2021 - ieeexplore.ieee.org
Trustworthiness is an important aspect for systems for IoT application, especially when it comes to solutions in the domains of security or privacy. Integrated circuits are an essential …
FPGAs allow reconfiguration of its logic at any point after production. The result is that they are effective at prototyping application-specific integrated circuits, updating the internal logic …
M Hassaan, K Gouda - International Journal of Database Management …, 2012 - bu.edu.eg
Graphs are widely used to model complicated data semantics in many applications. In our paper [8], we proposed Fast-ON, an efficient algorithm for subgraph isomorphism problem …