Results 31 to 40 of about 55,019 (192)
Graphs with Isomorphic Neighbor-subgraphs
Taiwanese Journal of Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chan, Chi-Feng +2 more
openaire +3 more sources
Static graph challenge: Subgraph isomorphism [PDF]
2017 IEEE High Performance Extreme Computing Conference (HPEC), 2017 The rise of graph analytic systems has created a need for ways to measure and compare the capabilities of these systems. Graph analytics present unique scalability difficulties. The machine learning, high performance computing, and visual analytics communities have wrestled with these difficulties for decades and developed methodologies for creating ...
Siddharth Samsi +11 more
openaire +2 more sources
Quasipolynomiality of the Smallest Missing Induced Subgraph
Journal of Graph Algorithms and Applications, 2023 We study the problem of finding the smallest graph that does not occur as an induced subgraph of a given graph. This missing induced subgraph has at most logarithmic size and can be found by a brute-force search, in an $n$-vertex graph, in time $n^{O ...
David Eppstein +2 more
doaj +1 more source
Domination Numbers of Amalgamations of Cycles at Connected Subgraphs
Journal of Mathematics, 2022 A set S of vertices of a graph G is a dominating set of G if every vertex in VG is adjacent to some vertex in S. A minimum dominating set in a graph G is a dominating set of minimum cardinality.
Prakassawat Boonmee +2 more
doaj +1 more source
Open Computer Science, 2020 In this paper, we study a well-known computationally hard problem, called the subgraph isomorphism problem where the goal is for a given pattern and target graphs to determine whether the pattern is a subgraph of the target graph. Numerous algorithms for
Mihelič Jurij, Čibej Uroš
doaj +1 more source
Approximate subgraph matching-based literature mining for biomedical events and relations. [PDF]
PLoS ONE, 2013 The biomedical text mining community has focused on developing techniques to automatically extract important relations between biological components and semantic events involving genes or proteins from literature.
Haibin Liu +3 more
doaj +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.
Lars Kotthoff +2 more
openaire +2 more sources
Deep Analysis on Subgraph Isomorphism
CoRR, 2020 Subgraph isomorphism is a well-known NP-hard problem which is widely used in many applications, such as social network analysis and knowledge graph query. Its performance is often limited by the inherent hardness. Several insightful works have been done since 2012, mainly optimizing pruning rules and matching orders to accelerate enumerating all ...
Li Zeng +3 more
openaire +2 more sources
Subgraph Isomorphism in Temporal Networks
CoRR, 2016 Temporal information is increasingly available as part of large network data sets. This information reveals sequences of link activations between network entities, which can expose underlying processes in the data. Examples include the dissemination of information through a social network, the propagation of musical ideas in a music sampling network ...
Ursula Redmond, Pádraig Cunningham
openaire +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 +2 more sources