Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"Subgraph Isomorphism"”.
-
Algoritmi avanzati per il Subgraph Isomorphism, Motif Discovery, e Graph Embedding su reti complesse
I grafi sono strumenti potenti nelle scienze computazionali, in grado di modellare relazioni complesse in ambiti come la bioinformatica, l'analisi delle reti sociali e la chimica computazionale. Questa tesi affronta sfide fondamentali nell'analisi dei grafi, con particolare riferimento al problema …
-
Cloneless: Code Clone Detection via Program Dependence Graphs with Relaxed Constraints
… clones using a program dependence graph and subgraph isomorphism to identify similar subgraphs, ultimately illuminating clones. The project imposes few constraints when comparing code segments to potentially reveal more clones.</p>
-
Graph Isomorphism Algorithms Based on Trees and Paths.
… bounded algorithms are presented for testing isomorphism of two classes of graphs: the strongly regular graphs, which have been difficult for many previous isomorphism algorithms to process, and the compact graphs (graphs with diameter of 2 whose complements also have diameter of 2).The …
-
Automatic Generation of Chemical Kinetic Models including Macromolecules in Multiphase Systems
… liquid phases. A decision tree model based on subgraph isomorphism for gas-phase radical thermochemistry is presented. The model demonstrates improved accuracy compared to the existing empirical model and reliable uncertainty estimates for both interpolation and extrapolation tasks. …
-
A framework for incremental view graph maintenance
… queries employ graph patterns to lookup all subgraphs in the graph data that satisfy certain graph structures. These subgraphs are called graph pattern matches. However, this graph pattern matching is NP-complete for subgraph isomorphism. Thus, graph queries can suffer a long response time, …
-
Finding Patterns, Short Cycles and Long Shortest Paths in Graphs
… of finding fixed-sized patterns in graphs as a subgraph, known as Graph Pattern Detection or Subgraph Isomorphism. There are no fast algorithms for graph pattern detection for many patterns despite many efforts, and so we focus on finding the source of hardness of detecting different patterns. …