Results 91 to 100 of about 1,396 (204)

Fuzzy graphs and their applications in finding the best route, dominant node and influence index in a network under the hesitant bipolar-valued fuzzy environment

Complex & Intelligent Systems
This paper introduces the concept of hesitant bipolar-valued fuzzy graph (HBVFG), which captures the two opposing perspectives, namely the positive and negative opinions.
Jambi Ratna Raja, Jeong Gon Lee, Dhanraj Dhotre, Pravin Mane, Omprakash Sugdeo Rajankar, Antonios Kalampakas, Navin D. Jambhekar, D. G. Bhalke   +7 more
doaj   +1 more source

Tree-depth and the Formula Complexity of Subgraph Isomorphism [PDF]

, 2020
Deepanshu Kush, Benjamin Rossman
openalex   +1 more source

Systematic benchmark of substructure search in molecular graphs - From Ullmann to VF2

Journal of Cheminformatics, 2012
Background Searching for substructures in molecules belongs to the most elementary tasks in cheminformatics and is nowadays part of virtually every cheminformatics software.
Ehrlich Hans-Christian, Rarey Matthias
doaj   +1 more source

Comparison of Maximum Common Subgraph Isomorphism Algorithms for the Alignment of 2D Chemical Structures [PDF]

, 2017
Edmund Duesbury, John D. Holliday, Peter Willett   +2 more
openalex   +1 more source

On the Variable Ordering in Subgraph Isomorphism Algorithms

IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2017
Graphs are mathematical structures to model several biological data. Applications to analyze them require to apply solutions for the subgraph isomorphism problem, which is NP-complete. Here, we investigate the existing strategies to reduce the subgraph isomorphism algorithm running time with emphasis on the importance of the order with which the graph ...
Bonnici Vincenzo, Giugno Rosalba
openaire   +4 more sources

Efficient Large-Scale IoT Botnet Detection through GraphSAINT-Based Subgraph Sampling and Graph Isomorphism Network

Mathematics
In recent years, with the rapid development of the Internet of Things, large-scale botnet attacks have occurred frequently and have become an important challenge to network security.
Lihua Yin, Weizhe Chen, Xi Luo, Hongyu Yang   +3 more
doaj   +1 more source

Homology analysis of malware based on graph

Tongxin xuebao, 2017
Malware detection and homology analysis has been the hotspot of malware analysis.API call graph of malware can represent the behavior of it.Because of the subgraph isomorphism algorithm has high complexity,the analysis of malware based on the graph ...
Bing-lin ZHAO, Xi MENG, Jin HAN, Jing WANG, Fu-dong LIU   +4 more
doaj   +2 more sources

Node Embedding and Cosine Similarity for Efficient Maximum Common Subgraph Discovery

Applied Sciences
Finding the maximum common induced subgraph is a fundamental problem in computer science. Proven to be NP-hard in the 1970s, it has, nowadays, countless applications that still motivate the search for efficient algorithms and practical heuristics.
Stefano Quer, Thomas Madeo, Andrea Calabrese, Giovanni Squillero, Enrico Carraro   +4 more
doaj   +1 more source

Subgraph Isomorphism: Prolog vs. Conventional

Subgraph Isomorphism uses a small graph as a pattern to identify within a larger graph a set of vertices that have matching edges. This paper addresses a logic program written in Prolog for a specific relatively complex graph pattern for which multiple conventional implementations (including parallel) exist.
Yin, Claire Y., Kogge, Peter M.
openaire   +2 more sources

Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions [PDF]

, 2020
Stephan Gocht, Ciaran McCreesh, Jakob Nordstr”öm   +2 more
openalex   +1 more source