Log in

Relevant bibliographies by topics / Subgraph isomorphism / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Subgraph isomorphism.

Dissertations / Theses on the topic 'Subgraph isomorphism'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 17 dissertations / theses for your research on the topic 'Subgraph isomorphism.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Nabti, Chems Eddine. "Subgraph Isomorphism Search In Massive Graph Data." Thesis, Lyon, 2017. http://www.theses.fr/2017LYSE1293/document.

Full text

Abstract:

L'interrogation de graphes de données est un problème fondamental qui connait un grand intérêt, en particulier pour les données structurées massives où les graphes constituent une alternative prometteuse aux bases de données relationnelles pour la modélisation des grandes masses de données. Cependant, l'interrogation des graphes de données est différente et plus complexe que l'interrogation des données relationnelles à base de tables. La tâche principale impliquée dans l'interrogation de graphes de données est la recherche d'isomorphisme de sous-graphes qui est un problème NP-complet.La recher

APA, Harvard, Vancouver, ISO, and other styles

2

Ren, Xuguang. "Speeding up Subgraph Isomorphism Search in Large Graphs." Thesis, Griffith University, 2018. http://hdl.handle.net/10072/381513.

Full text

Abstract:

Graph is a widely used model to represent complicated data in many domains. Finding subgraph isomorphism is a fundamental function for many graph databases and data mining applications handling graph data. This thesis studies this classic problem by considering a set of novel techniques from three different aspects. This thesis first considers speeding up subgraph isomorphism search by exploiting relationships among data vertices. Most of the subgraph isomorphism algorithms of the In-Memory model (IM) are based on a backtracking method which computes the solutions by incrementally enumerating

APA, Harvard, Vancouver, ISO, and other styles

3

Minot, Maël. "Investigating decomposition methods for the maximum common subgraph and sum colouring problems." Thesis, Lyon, 2017. http://www.theses.fr/2017LYSEI120/document.

Full text

Abstract:

Notre objectif est d’évaluer et de rendre opérationnelle la décomposition de problèmes d’optimisation sous contraintes. Nous nous sommes intéressés à deux problèmes en particulier : le problème de la recherche d’un plus grand sous-graphe commun (MCIS), et le problème de somme coloration minimale (MSCP). Il s’agit de problèmes NP-difficiles pour lesquels les approches de résolution complètes passent difficilement à l’échelle, et nous proposons de les améliorer à cet égard en décomposant ces problèmes en sous-problèmes indépendants. Les décompositions que nous proposons s’appuient sur la structu

APA, Harvard, Vancouver, ISO, and other styles

4

Hourcade, Hugo. "Énumération de motifs temporels." Electronic Thesis or Diss., Sorbonne université, 2023. http://www.theses.fr/2023SORUS079.

Full text

Abstract:

Dans le cadre de l'étude des interactions de divers acteurs au sein d'un système, la recherche de schémas comportementaux trouve nombre d'applications. Les graphes temporels qui m'intéressent dans le cadre de cette thèse présentent des tailles d'historiques tau, à savoir le nombre d'instants temporels entre le premier instant t0 et le dernier instant tf pour lesquels G n'est pas vide, de l'ordre de plusieurs millions. Je cherche donc à minimiser l'impact de tau sur les complexités spatiales et temporelles de mes algorithmes. Étant donné Delta un entier naturel, l'énumération de Delta-modules e

APA, Harvard, Vancouver, ISO, and other styles

5

Tian, Chao. "Towards effective analysis of big graphs : from scalability to quality." Thesis, University of Edinburgh, 2017. http://hdl.handle.net/1842/29578.

Full text

Abstract:

This thesis investigates the central issues underlying graph analysis, namely, scalability and quality. We first study the incremental problems for graph queries, which aim to compute the changes to the old query answer, in response to the updates to the input graph. The incremental problem is called bounded if its cost is decided by the sizes of the query and the changes only. No matter how desirable, however, our first results are negative: for common graph queries such as graph traversal, connectivity, keyword search and pattern matching, their incremental problems are unbounded. In light o

APA, Harvard, Vancouver, ISO, and other styles

6

Hofton, Antony Edward. "Graph layout using subgraph isomorphisms." Thesis, Durham University, 2000. http://etheses.dur.ac.uk/4337/.

Full text

Abstract:

Today, graphs are used for many things. In engineering, graphs are used to design circuits in very large scale integration. In computer science, graphs are used in the representation of the structure of software. They show information such as the flow of data through the program (known as the data flow graph [1]) or the information about the calling sequence of programs (known as the call graph [145]). These graphs consist of many classes of graphs and may occupy a large area and involve a large number of vertices and edges. The manual layout of graphs is a tedious and error prone task. Algori

APA, Harvard, Vancouver, ISO, and other styles

7

Stejskal, Roman. "Zjišťování izomorfizmu grafů v databázi." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2008. http://www.nusl.cz/ntk/nusl-236007.

Full text

Abstract:

This project introduces history and basic notions of the graph theory. It describes graph theory problems, possible graph representations and practical graph management in databases. Aims to subgraph and graph isomorphism. It describes possible ways to find graph isomorphism and chosen algorithms for subgraph and graph isomorphism. The experimental part aims to comparing two implemented algorithms. These are Ullmann and VF2 algorithm. Also searches difference between graphs stored in memory and graphs stored in database.

APA, Harvard, Vancouver, ISO, and other styles

8

Vergara, John Paul C. "Edge-packing by isomorphic subgraphs." Thesis, Virginia Tech, 1990. http://hdl.handle.net/10919/42147.

Full text

Abstract:

Maximum G Edge-Packing (E Pack<sub>G</sub>) is the problem of finding the maximum number of edge-disjoint isomorphic copies of a fixed guest graph G in a host graph H. The problem is primarily considered for several guest graphs (stars, paths and cycles) and host graphs (arbitrary graphs, planar graphs and trees). We give polynomial-time algorithms when G is a 2-path or when H is a tree; we show the problem is NP-complete otherwise. Also, we propose straightforward greedy polynomial-time approximation algorithms which are at least 1/|E<sub>G</sub>| optimal.<br>Master of Science

APA, Harvard, Vancouver, ISO, and other styles

9

Ševčík, Ivan. "Systém pro vyhledávání chemických struktur." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2018. http://www.nusl.cz/ntk/nusl-385936.

Full text

Abstract:

This thesis deals with the problem of searching of structures in large chemical compounds databases. The aim is to design and implement an efficient system that supports two basic types of search, which are identity and substructure search. This task is complicated not only by the large number of entries in databases but also by graph representation of chemical structures, for which many algorithms are hard to solve. The thesis will introduce concepts which will prove useful in solving these problems. A web service is also created as a part of the thesis in order to make the database searching

APA, Harvard, Vancouver, ISO, and other styles

10

Oberoi, Kamaldeep Singh. "Modélisation spatio-temporelle du trafic routier en milieu urbain." Thesis, Normandie, 2019. http://www.theses.fr/2019NORMR075/document.

Full text

Abstract:

Le domaine de la modélisation du trafic routier vise à comprendre son évolution. Dans les dernières années, plusieurs modèles du trafic ont été proposés dans l’objectif de géolocaliser les embouteillages au sein du trafic, détecter des motifs dans le trafic routier, estimer l’état du trafic etc. La plupart des modèles proposés considèrent le trafic routier en termes de ses constituants ou comme une entité agrégée en fonction de l’échelle choisie et expliquent l’évolution du trafic quantitativement en tenant compte des relations entre les variables de trafic comme le flot, la densité et la vite

APA, Harvard, Vancouver, ISO, and other styles

11

Lüthen, Hendrik [Verfasser], Marc E. [Akademischer Betreuer] Pfetsch, and Frauke [Akademischer Betreuer] Liers. "Partitioning into Isomorphic or Connected Subgraphs / Hendrik Lüthen ; Marc E. Pfetsch, Frauke Liers." Darmstadt : Universitäts- und Landesbibliothek Darmstadt, 2019. http://d-nb.info/1179915097/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

"A constraint programming approach to subgraph isomorphism." Université catholique de Louvain, 2008. http://edoc.bib.ucl.ac.be:81/ETD-db/collection/available/BelnUcetd-06262008-145353/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Lei, Yaohui. "A survey of graph and subgraph isomorphism problems." Thèse, 2003. http://hdl.handle.net/1866/14540.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Hall, Robert Joseph. "Learning by Failing to Explain." 1986. http://hdl.handle.net/1721.1/6850.

Full text

Abstract:

Explanation-based Generalization requires that the learner obtain an explanation of why a precedent exemplifies a concept. It is, therefore, useless if the system fails to find this explanation. However, it is not necessary to give up and resort to purely empirical generalization methods. In fact, the system may already know almost everything it needs to explain the precedent. Learning by Failing to Explain is a method which is able to exploit current knowledge to prune complex precedents, isolating the mysterious parts of the precedent. The idea has two parts: the notion of parti

APA, Harvard, Vancouver, ISO, and other styles

15

Šípek, Vojtěch. "Porovnání přístupů k dotazování chemických sloučenin." Master's thesis, 2019. http://www.nusl.cz/ntk/nusl-398712.

Full text

Abstract:

The purpose of this thesis is to perform an analysis of approaches to querying chemical databases and to validate or invalidate its results. Currently, there exists no work which would compare the performance and memory usage of the best performing approaches on the same data set. In this thesis, we address this lack of information and we create an un-biased benchmark of the most popular index building methods for subgraph querying of chemical databases. Also, we compare the results of such benchmark with the performance results of an SQL and a graph database. 1

APA, Harvard, Vancouver, ISO, and other styles

16

Ray, Baishakhi. "Analysis of cross-system porting and porting errors in software projects." 2013. http://hdl.handle.net/2152/22103.

Full text

Abstract:

Software forking---creating a variant product by copying and modifying an existing project---is often considered an ad hoc, low cost alternative to principled product line development. To maintain forked projects, developers need to manually port existing features or bug-fixes from one project to another. Such manual porting is not only tedious but also error-prone. When the contexts of the ported code vary, developers often have to adapt the ported code to fit its surroundings. Faulty adaptations or inconsistent updates of the ported code could potentially introduce subtle inconsistencies in

APA, Harvard, Vancouver, ISO, and other styles

17

Lüthen, Hendrik. "Partitioning into Isomorphic or Connected Subgraphs." Phd thesis, 2019. https://tuprints.ulb.tu-darmstadt.de/8457/1/LuethenDissertation.pdf.

Full text

Abstract:

This thesis deals mainly with the partitioning and connectedness of graphs. First, we show that the problem of partitioning the nodes of a graph into a specific number of subsets such that the induced subgraphs on these sets are isomorphic to one another is NP-complete. If the induced subgraphs have to be connected, the problem remains NP-complete. Then we inspect some special graph classes for which the problem is solvable in polynomial time. Afterwards, we deal with the problem of defining a polytope by incidence vectors of nodes, which induce a connected graph. We inspect some facet-defini

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!