Results 21 to 30 of about 39,682 (219)
An Efficient Subgraph Isomorphism Solver for Large Graphs
IEEE Access, 2021 For a given pair of pattern and data graphs, the subgraph isomorphism finding problem locates all instances of the pattern graph into the data graph. For a given subgraph isomorphic image of the pattern graph in a data graph, the set of all ordered pairs
Zubair Ali Ansari +2 more
doaj +1 more source
The search for minimal edge 1-extension of an undirected colored graph [PDF]
Известия Саратовского университета. Новая серия. Серия Математика. Механика. Информатика, 2021 Let $G=(V, \alpha, f)$ be a colored graph with a coloring function $f$ defined on its vertices set $V$. Colored graph $G^*$ is an edge $1$-extension of a colored graph $G$ if $G$ could be included into each subgraph taking into consideration the colors ...
Razumovsky, Peter Vladimirovich
doaj +1 more source
A Zero Knowledge Authentication Protocol Based on Novel Heuristic Algorithm of Dense Induced Subgraphs Isomorphism [PDF]
Engineering and Technology Journal, 2015 Graphs provide an useful mathematical tool for modeling various real world phenomena. Dense graphs arise in many places of interest, for instance the internet and social networks to name just two. The density of a graph should be a real number reflecting
N. M. G. Al-Saidi +2 more
doaj +1 more source
A coding method for efficient subgraph querying on vertex- and edge-labeled graphs. [PDF]
PLoS ONE, 2014 Labeled graphs are widely used to model complex data in many domains, so subgraph querying has been attracting more and more attention from researchers around the world.
Lei Zhu +5 more
doaj +1 more source
TemporalRI: subgraph isomorphism in temporal networks with multiple contacts
Applied Network Science, 2021 Temporal networks are graphs where each edge is associated with a timestamp denoting when two nodes interact. Temporal Subgraph Isomorphism (TSI) aims at retrieving all the subgraphs of a temporal network (called target) matching a smaller temporal ...
Giovanni Micale +3 more
doaj +1 more source
Research on the Top-Down Parsing Method for Context-Sensitive Graph Grammars. [PDF]
PLoS ONE, 2015 The parsing problem is one of the key problems of graph grammars. The typical parsing algorithm uses the bottom-up method. The time-complexity of this method is high, and it is difficult to apply.
Yi Wang, XiaoQin Zeng, Han Ding
doaj +1 more source
A survey of graph and subgraph isomorphism problems
, 2004 Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.
Yaohui Lei
openalex +2 more sources
MODIT: MOtif DIscovery in Temporal Networks
Frontiers in Big Data, 2022 Temporal networks are graphs where each edge is linked with a timestamp, denoting when an interaction between two nodes happens. According to the most recently proposed definitions of the problem, motif search in temporal networks consists in finding and
Roberto Grasso +4 more
doaj +1 more source
Between Subgraph Isomorphism and Maximum Common Subgraph [PDF]
, 2017 When a small pattern graph does not occur inside a larger target graph, we can ask how to find "as much of the pattern as possible" inside the target graph.
Hoffmann, Ruth +2 more
core +1 more source
Learning with Small Data: Subgraph Counting Queries
Data Science and Engineering, 2023 Deep Learning (DL) has been widely used in many applications, and its success is achieved with large training data. A key issue is how to provide a DL solution when there is no large training data to learn initially.
Kangfei Zhao +3 more
doaj +1 more source