Results 91 to 100 of about 1,956 (175)
Node Embedding and Cosine Similarity for Efficient Maximum Common Subgraph Discovery
Applied SciencesFinding 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 +4 more
doaj +1 more source
Maximum Common Subgraph Isomorphism Algorithms [PDF]
, 2017 Maximum common subgraph (MCS) isomorphism algorithms play an important role in chemoinformatics by providing an effective mechanism for the alignment of pairs of chemical structures. This article discusses the various types of MCS that can be identified
Willett, P. +2 more
core
Improved VF2 Algorithm for Notch Feature Recognition Based on MCF
Nanjing Hangkong Hangtian Daxue XuebaoBuilding upon existing methods for three-dimensional geometric rule recognition， this paper proposes a sealed-cavity notch feature recognition algorithm based on an attributed adjacency graph （AAG）.
GUO Xifeng +4 more
doaj +1 more source
Topological features and iterative node elimination for speeding up subgraph isomorphism detection
, 2023 In this paper we tackle the problem of subgraph isomorphism detection on large graphs, which may commonly be intractable, even with state of the art algorithms. Rather than competing with other matching algorithms, we define enhancements that can be used
Y Gao (4703698) +3 more
core
The Formula Complexity of Subgraph Isomorphism
, 2017 I will report recent progress on the formula complexity of the (colorful) subgraph isomorphism problem. (1) In previous work with Li and Razborov (FOCS 2014), we showed that the AC0-circuit complexity of G-subgraph isomorphism is n^{Theta~(treewidth(G))
Rossman, Benjamin
core
Random Generation Topology Coding Technique in Asymmetric Topology Encryption
MathematicsThe security of traditional public key cryptography algorithms depends on the difficulty of the underlying mathematical problems. Asymmetric topological encryption is a graph-dependent encryption algorithm produced to resist attacks by quantum computers ...
Jing Su, Bing Yao
doaj +1 more source
Subgraph isomorphism problem in planar graphs
, 2013 V problemu izomorfizma podgrafov imamo podana dva grafa G in H. Za njiju je potrebno ugotoviti, ali graf G vsebuje podgraf, ki je izomorfen grafu H. Problem je v splošnem NP-poln. V magistrskem delu se omejimo na problem izomorfizmov podgrafov ravninskih
Kelenc, Aleksander
core
Inductive queries for a drug designing robot scientist
, 2010 It is increasingly clear that machine learning algorithms need to be integrated in an iterative scientific discovery loop, in which data is queried repeatedly by means of inductive queries and where the computer provides guidance to the experiments that ...
Amanda Schierz +15 more
core +1 more source
Fast and Accurate Efficient Streaming Subgraph Isomorphism
Queries to detect isomorphic subgraphs are important in graph-based data management. While the problem of subgraph isomorphism search has received considerable attention for the static setting of a single query, or a batch thereof, existing approaches do
Weidlich, Matthias +5 more
core
cuTS: Scaling Subgraph Isomorphism on Distributed Multi-GPU Systems Using Trie Based Data Structure
, 2021 Subgraph isomorphism is a pattern-matching algorithm widely used in many domains such as chem-informatics, bioinformatics, databases, and social network analysis. It is computationally expensive and is a proven NP-hard problem. The massive parallelism in
Xiang, Lizhi +4 more
core