Results 61 to 70 of about 1,396 (204)
Accelerating Subgraph Matching Through Advanced Compression and Label Filtering
AlgorithmsEfficiently identifying subgraphs that match a given query graph within large-scale graphs has become a critical focus in both academic and industrial research.
Yanfeng Chai, Jiashu Li, Qiang Zhang
doaj +1 more source
Application of dynamic expansion tree for finding large network motifs in biological networks [PDF]
PeerJ, 2019 Network motifs play an important role in the structural analysis of biological networks. Identification of such network motifs leads to many important applications such as understanding the modularity and the large-scale structure of biological networks,
Sabyasachi Patra, Anjali Mohapatra
doaj +2 more sources
Computing and Drawing Isomorphic Subgraphs [PDF]
, 2002 The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. Then the graph partitions into a large subgraph, its copy and a remainder. The problem resembles the NP-hard largest common subgraph problem.
Sabine Bachl, Franz-Josef Brandenburg
openaire +1 more source
Electronics Letters, Volume 62, Issue 1, January/December 2026.This paper investigates how circuit representation, flat SPICE Netlists versus structured PySpice code, influences LLM performance in functional block recognition tasks. Using a benchmark of six analogue comparator circuits derived from a standard educational collection. Our results reveal that most models showed decreased performance on the structured
Andrei Dăescu +3 more
wiley +1 more source
Subgraph isomorphism in graph classes
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kijima, Shuji +3 more
openaire +2 more sources
Coxeter's enumeration of Coxeter groups
Journal of the London Mathematical Society, Volume 113, Issue 1, January 2026.Abstract In a short paper that appeared in the Journal of the London Mathematical Society in 1934, H. S. M. Coxeter completed the classification of finite Coxeter groups. In this survey, we describe what Coxeter did in this paper and examine an assortment of topics that illustrate the broad and enduring influence of Coxeter's paper on developments in ...
Bernhard Mühlherr, Richard M. Weiss
wiley +1 more source
Characterization of Android malware based on subgraph isomorphism [PDF]
, 2021 Alain Menelet, Charles‐Edmond Bichot
openalex +1 more source
Portfolios of Subgraph Isomorphism Algorithms [PDF]
, 2016 Subgraph isomorphism is a computationally challenging problem with\ud important practical applications, for example in computer vision, biochemistry,\ud and model checking. There are a number of state-of-the-art algorithms for solving\ud the problem, each of which has its own performance characteristics.
Kotthoff, Lars +2 more
openaire +2 more sources
Taming subgraph isomorphism for RDF query processing [PDF]
Proceedings of the VLDB Endowment, 2015 RDF data are used to model knowledge in various areas such as life sciences, Semantic Web, bioinformatics, and social graphs. The size of real RDF data reaches billions of triples. This calls for a framework for efficiently processing RDF data. The core function of processing RDF data is subgraph pattern matching.
Kim, Jinha +4 more
openaire +2 more sources