Results 51 to 60 of about 39,682 (219)
TM-Miner: TFS-Based Algorithm for Mining Temporal Motifs in Large Temporal Network
IEEE Access, 2019 Temporal network is a basic tool for representing complex systems, such as communication networks and social networks; besides the temporal motif (TM) plays an important role in the analysis of temporal networks.
Xiaoli Sun +4 more
doaj +1 more source
A Partitioning Algorithm for Maximum Common Subgraph Problems [PDF]
, 2017 We introduce a new branch and bound algorithm for the maximum common subgraph and maximum common connected subgraph problems which is based around vertex labelling and partitioning.
McCreesh, Ciaran +2 more
core +2 more sources
Weighted Turán Theorems With Applications to Ramsey‐Turán Type of Problems
Journal of Graph Theory, EarlyView.ABSTRACT We study extensions of Turán Theorem in edge‐weighted settings. A particular case of interest is when constraints on the weight of an edge come from the order of the largest clique containing it. These problems are motivated by Ramsey‐Turán type problems.
József Balogh +2 more
wiley +1 more source
Trade-Offs Computing Minimum Hub Cover Toward Optimized Labeled Graph Query Processing
Online Academic Journal of Information Technology, 2018 As techniques for graph query processing mature, the need for optimization is increasingly becoming an imperative. Indices are one of the key ingredients toward efficient query processing strategies via cost-based optimization.
Hasan M. Jamil +3 more
doaj +1 more source
Fast parallel algorithms for the subgraph homeomorphism and the subgraph isomorphism problem for classes of planar graphs [PDF]
, 1987 We consider the problems of subgraph homeomorphism with fixed pattern graph, recognition, and subgraph isomorphism for some classes of planar graphs. Following the results of Robertson and Seymour on forbidden minor characterization, we show that the problems of fixed subgraph homeomorphism and recognition for any family of planar graphs closed under ...
Lingas, Andrzej, Proskurowski, Andrzej
openaire +1 more source
A Triangle Framework among Subgraph Isomorphism, Pharmacophore and Structure-function Relationship
The Web Conference, 2022 Coronavirus disease 2019 (COVID-19) has gained utmost attention in the current time from academic research and industrial practices because it continues to rage in many countries.
Mengjiao Guo +4 more
semanticscholar +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
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
Subgraph Isomorphism Algorithm Based on Color Coding [PDF]
, 2016 Tato práce popisuje řešení problému izomorfismu podgrafů pomocí techniky barevného kódování. V práci je popsán problém izomorfismu podgrafů, jeho varianty a jeho aplikace.
Malík Josef
core
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