Results 81 to 90 of about 101,745 (269)
Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination [PDF]
, 2007 Recently, great efforts have been dedicated to researches on the management of large scale graph based data such as WWW, social networks, biological networks.
He, Zhengying +3 more
core +1 more source
Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials
Journal of Graph Theory, EarlyView.ABSTRACT An oriented graph D $D$ is converse invariant if, for any tournament T $T$, the number of copies of D $D$ in T $T$ is equal to that of its converse −D $-D$. El Sahili and Ghazo Hanna [J. Graph Theory 102 (2023), 684‐701] showed that any oriented graph D $D$ with maximum degree at most 2 is converse invariant.
Jiangdong Ai +4 more
wiley +1 more source
GC : a graph caching system for subgraph / supergraph queries [PDF]
We demonstrate a graph caching system GC for expediting subgraph/supergraph queries, which are computationally expensive due to the entailed NP-Complete subgraph isomorphism problem.
Liu, Zichen +4 more
core +1 more source
Faster Algorithms for the Maximum Common Subtree Isomorphism Problem [PDF]
, 2016 The maximum common subtree isomorphism problem asks for the largest possible isomorphism between subtrees of two given input trees. This problem is a natural restriction of the maximum common subgraph problem, which is ${\sf NP}$-hard in general graphs ...
Droschinsky, Andre +2 more
core +2 more sources
Beating Treewidth for Average-Case Subgraph Isomorphism [PDF]
Algorithmica, 2021 For any fixed graph $G$, the subgraph isomorphism problem asks whether an $n$-vertex input graph has a subgraph isomorphic to $G$. A well-known algorithm of Alon, Yuster and Zwick (1995) efficiently reduces this to the "colored" version of the problem, denoted $G$-$\mathsf{SUB}$, and then solves $G$-$\mathsf{SUB}$ in time $O(n^{tw(G)+1})$ where $tw(G)$
openaire +5 more sources
On Endomorphism Universality of Sparse Graph Classes
Journal of Graph Theory, EarlyView.ABSTRACT We show that every commutative idempotent monoid (a.k.a. lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr and the degree bound is best‐possible. On the other hand, we show that no class excluding a minor can have all commutative idempotent monoids among its endomorphism monoids. As a by‐product,
Kolja Knauer, Gil Puig i Surroca
wiley +1 more source
Frontiers in Physiology, 2023 Introduction: Given the direct association with malignant ventricular arrhythmias, cardiotoxicity is a major concern in drug design. In the past decades, computational models based on the quantitative structure–activity relationship have been proposed to
Huijia Wang +7 more
doaj +1 more source
Intelligent Medical Diagnosis Model Based on Graph Neural Networks for Medical Images
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT Recently, numerous estimation issues have been solved due to the developments in data‐driven artificial neural networks (ANN) and graph neural networks (GNN). The primary limitation of previous methodologies has been the dependence on data that can be structured in a grid format.
Ashutosh Sharma, Amit Sharma, Kai Guo
wiley +1 more source
On the universal pairing for 2‐complexes
Bulletin of the London Mathematical Society, EarlyView.Abstract The universal pairing for manifolds was defined and shown to lack positivity in dimension 4 in [Freedman, Kitaev, Nayak, Slingerland, Walker, and Wang, J. Geom. Topol. 9 (2005), 2303–2317]. We prove an analogous result for 2‐complexes, and show that the universal pairing does not detect the difference between simple homotopy equivalence and 3 ...
Mikhail Khovanov +2 more
wiley +1 more source
Fractional Q-Edge-Coloring of Graphs
Discussiones Mathematicae Graph Theory, 2013 An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let be an additive hereditary property of graphs.
Czap Július, Mihók Peter
doaj +1 more source