Log in

Relevant bibliographies by topics / Large graphs / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Large graphs.

Dissertations / Theses on the topic 'Large graphs'

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 50 dissertations / theses for your research on the topic 'Large graphs.'

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

Le, Tien Nam. "Patterns in Large Graphs." Thesis, Lyon, 2018. http://www.theses.fr/2018LYSEN079/document.

Full text

Abstract:

Un graphe est un ensemble de noeuds, ensemble de liens reliant des paires de noeuds. Avec la quantité accumulée de données collectées, il existe un intérêt croissant pour la compréhension des structures et du comportement de très grands graphes. Néanmoins, l’augmentation rapide de la taille des grands graphes rend l’étude de tous les graphes de moins en moins efficace. Ainsi, il existe une demande impérieuse pour des méthodes plus efficaces pour étudier de grands graphes sans nécessiter la connaissance de tous les graphes. Une méthode prometteuse pour comprendre le comportement de grands graph

APA, Harvard, Vancouver, ISO, and other styles

2

Henry, Tyson Rombauer. "Interactive graph layout: The exploration of large graphs." Diss., The University of Arizona, 1992. http://hdl.handle.net/10150/185833.

Full text

Abstract:

Directed and undirected graphs provide a natural notation for describing many fundamental structures of computer science. Unfortunately graphs are hard to draw in an easy to read fashion. Traditional graph layout algorithms have focused on creating good layouts for the entire graph. This approach works well with smaller graphs, but often cannot produce readable layouts for large graphs. This dissertation presents a novel methodology for viewing large graphs. The basic concept is to allow the user to interactively navigate through large graphs, learning about them in appropriately small and con

APA, Harvard, Vancouver, ISO, and other styles

3

Li, Yifan. "Edge partitioning of large graphs." Thesis, Paris 6, 2017. http://www.theses.fr/2017PA066346/document.

Full text

Abstract:

Dans cette thèse nous étudions un problème fondamental, le partitionnement de graphe, dans le contexte de la croissance rapide des données, le volume des données continues à augmenter, allant des réseaux sociaux à l'internet des objets. En particulier, afin de vaincre les propriétés intraitables existant dans de nombreuses graphies, par exemple, la distribution des degrés en loi de puissance, nous appliquons un nouveau mode pour coupe de sommet, à la place de la méthode traditionnelle (coupe de bord), ainsi que pour assurer une charge de travail équilibrée et raisonnablement dans le traitement

APA, Harvard, Vancouver, ISO, and other styles

4

Larsson, Patrik. "Analyzing and adapting graph algorithms for large persistent graphs." Thesis, Linköping University, Department of Computer and Information Science, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-15422.

Full text

Abstract:

<p>In this work, the graph database Neo4j developed by Neo Technology is presented together with some of it's functionality when it comes to accessing data as a graph. This type of data access brings the possibility to implement common graph algorithms on top of Neo4j. Examples of such algorithms are presented together with their theoretical backgrounds. These are mainly algorithms for finding shortest paths and algorithms for different graph measures such as centrality measures. The implementations that have been made are presented, as well as complexity analysis and the performance measures

APA, Harvard, Vancouver, ISO, and other styles

5

Zhang, Shijie. "Index-based Graph Querying and Matching in Large Graphs." Cleveland, Ohio : Case Western Reserve University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=case1263256028.

Full text

Abstract:

Thesis(Ph.D.)--Case Western Reserve University, 2010<br>Title from PDF (viewed on 2010-04-12) Department of Electrical Engineering and Computer Science (EECS) Includes abstract Includes bibliographical references and appendices Available online via the OhioLINK ETD Center

APA, Harvard, Vancouver, ISO, and other styles

6

Das, Sarma Atish. "Algorithms for large graphs." Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/34709.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Taylor, Amelia May. "Substructures in large graphs." Thesis, University of Birmingham, 2017. http://etheses.bham.ac.uk//id/eprint/7241/.

Full text

Abstract:

The first problem we address concerns Hamilton cycles. Suppose G is a large digraph in which every vertex has in- and outdegree at least |G|/2. We show that G contains every orientation of a Hamilton cycle except, possibly, the antidirected one. The antidirected case was settled by DeBiasio and Molla. Our result is best possible and improves on an approximate result by Häggkvist and Thomason. We then investigate the random greedy F-free process which was initially studied by Erdős, Suen and Winkler and by Spencer. This process greedily adds edges without creating a copy of F, terminating in a

APA, Harvard, Vancouver, ISO, and other styles

8

Li, Yifan. "Edge partitioning of large graphs." Electronic Thesis or Diss., Paris 6, 2017. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2017PA066346.pdf.

Full text

Abstract:

Dans cette thèse nous étudions un problème fondamental, le partitionnement de graphe, dans le contexte de la croissance rapide des données, le volume des données continues à augmenter, allant des réseaux sociaux à l'internet des objets. En particulier, afin de vaincre les propriétés intraitables existant dans de nombreuses graphies, par exemple, la distribution des degrés en loi de puissance, nous appliquons un nouveau mode pour coupe de sommet, à la place de la méthode traditionnelle (coupe de bord), ainsi que pour assurer une charge de travail équilibrée et raisonnablement dans le traitement

APA, Harvard, Vancouver, ISO, and other styles

9

Tsalouchidou, Ioanna. "Temporal analysis of large dynamic graphs." Doctoral thesis, Universitat Pompeu Fabra, 2018. http://hdl.handle.net/10803/663755.

Full text

Abstract:

The objective of this thesis is to provide a temporal analysis of the structural and interaction dynamics of large evolving graphs. In this thesis we propose new definitions of important graph metrics in order to include the temporal dimension of the dynamic graphs. We further extend the three important problems of data mining, in the temporal setting. The three problems that we propose are temporal graph summarization, temporal community search and temporal betweenness centrality. Additionally, we propose a distributed version of all our algorithms, that help our techniques to scale u

APA, Harvard, Vancouver, ISO, and other styles

10

Zhang, Yang. "Visually Analyzing Large Scale Graphs." The Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1439951819.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Turifi, Maher. "Optimisation techniques for finding connected components in large graphs using GraphX." Thesis, University of Salford, 2018. http://usir.salford.ac.uk/44945/.

Full text

Abstract:

The problem of finding connected components in undirected graphs has been well studied. It is an essential pre-processing step to many graph computations, and a fundamental task in graph analytics applications, such as social network analysis, web graph mining and image processing. Recently, it has been a major area of interest within the field of large graph processing. However, much of the research has focused on solving the problem using High Performance Computers (HPC). In large distributed systems, the MapReduce framework dominates the processing of big data, and has been used for finding

APA, Harvard, Vancouver, ISO, and other styles

12

Garcia, Gasulla Dario. "Link prediction in large directed graphs." Doctoral thesis, Universitat Politècnica de Catalunya, 2015. http://hdl.handle.net/10803/299070.

Full text

Abstract:

The first chapter introduces an approach to machine learning (ML) were data is understood as a network of connected entities. This strategy seeks inter-entity information for knowledge discovery, in contrast with traditional intra-entity approaches based on instances and their features. We discuss the importance of this connectivist ML (which we refer to as graph mining) in the current context where large, topology-based data sets have been made available. Chapter ends by introducing the Link Prediction (LP) problem, together with its current computational and performance limitations. The sec

APA, Harvard, Vancouver, ISO, and other styles

13

Naia, dos Santos Tassio. "Large structures in dense directed graphs." Thesis, University of Birmingham, 2018. http://etheses.bham.ac.uk//id/eprint/8658/.

Full text

Abstract:

We answer questions in extremal combinatorics, for directed graphs. Specifically, we investigate which large tree-like directed graphs are contained in all dense directed graphs of large order. More precisely, let T be an oriented tree of order n; among others, we establish the following results. (1) We obtain a sufficient condition which ensures every tournament of order n contains T, and show that almost every tree possesses this property. (2) We prove that for all positive C, ɛ and sufficiently large n, every tournament of order (1+ɛ)n contains T if Δ(T)≤(log n)^C. (3) We prove that for all

APA, Harvard, Vancouver, ISO, and other styles

14

Chen, Siqi. "Community Detection in Large Directed Graphs." University of Cincinnati / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1592170504620766.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Guerrieri, Alessio. "Distributed Computing for Large-scale Graphs." Doctoral thesis, Università degli studi di Trento, 2015. https://hdl.handle.net/11572/368736.

Full text

Abstract:

The last decade has seen an increased attention on large-scale data analysis, caused mainly by the availability of new sources of data and the development of programming model that allowed their analysis. Since many of these sources can be modeled as graphs, many large-scale graph processing frameworks have been developed, from vertex-centric models such as pregel to more complex programming models that allow asynchronous computation, can tackle dynamism in the data and permit the usage of different amount of resources. This thesis presents theoretical and practical results in the area of dist

APA, Harvard, Vancouver, ISO, and other styles

16

Guerrieri, Alessio. "Distributed Computing for Large-scale Graphs." Doctoral thesis, University of Trento, 2015. http://eprints-phd.biblio.unitn.it/1613/1/main.pdf.

Full text

Abstract:

The last decade has seen an increased attention on large-scale data analysis, caused mainly by the availability of new sources of data and the development of programming model that allowed their analysis. Since many of these sources can be modeled as graphs, many large-scale graph processing frameworks have been developed, from vertex-centric models such as pregel to more complex programming models that allow asynchronous computation, can tackle dynamism in the data and permit the usage of different amount of resources. This thesis presents theoretical and practical results in the area of dis

APA, Harvard, Vancouver, ISO, and other styles

17

Yuan, Wenjun, and 袁文俊. "Flexgraph: flexible subgraph search in large graphs." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2010. http://hub.hku.hk/bib/B46087539.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Maryokhin, Tymur. "Data dissemination in large-cardinality social graphs." Thesis, Linnéuniversitetet, Institutionen för datavetenskap (DV), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-48268.

Full text

Abstract:

Near real-time event streams are a key feature in many popular social media applications. These types of applications allow users to selectively follow event streams to receive a curated list of real-time events from various sources. Due to the emphasis on recency, relevance, personalization of content, and the highly variable cardinality of social subgraphs, it is extremely difficult to implement feed following at the scale of major social media applications. This leads to multiple architectural approaches, but no consensus has been reached as to what is considered to be an idiomatic solution

APA, Harvard, Vancouver, ISO, and other styles

19

Singh, Shashank. "Scalable Analysis of Large Dynamic Dependence Graphs." The Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1431093345.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Islam, Md Kamrul. "Explainable link prediction in large complex graphs - application to drug repurposing." Electronic Thesis or Diss., Université de Lorraine, 2022. http://www.theses.fr/2022LORR0203.

Full text

Abstract:

De nombreux systèmes complexes du monde réel peuvent être représentés par des graphes, où les nœuds représentent des entités et les liens des relations entre les paires de nœuds. La prédiction de liens (LP) est l'un des problèmes les plus intéressants et les plus anciens dans le domaine de l'exploration de graphes ; elle prédit la probabilité d'un lien entre deux nœuds non connectés. Cette thèse étudie le problème LP dans les graphes simples et les graphes de connaissances (KGs). La première partie de cette thèse se concentre sur le problème LP dans les graphes simples. Dans la première étude,

APA, Harvard, Vancouver, ISO, and other styles

21

Federici, Bruno. "Interactions between large-scale invariants in infinite graphs." Thesis, University of Warwick, 2017. http://wrap.warwick.ac.uk/108882/.

Full text

Abstract:

This thesis is devoted to the study of a number of properties of graphs. Our first main result clarifies the relationship between hyperbolicity and non-amenability for plane graphs of bounded degree. This generalises a known result for Cayley graphs to bounded degree graphs. The second main result provides a counterexample to a conjecture of Benjamini asking whether a transient, hyperbolic graph must have a transient subtree. In Chapter 4 we endow the set of all graphs with two pseudometrics and we compare metric properties arising from each of them. The two remaining chapters deal with bi-inf

APA, Harvard, Vancouver, ISO, and other styles

22

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

23

Bury, Marc [Verfasser], Beate [Akademischer Betreuer] Bollig, and Martin [Gutachter] Sauerhoff. "On graph algorithms for large-scale graphs / Marc Bury. Betreuer: Beate Bollig. Gutachter: Martin Sauerhoff." Dortmund : Universitätsbibliothek Dortmund, 2015. http://d-nb.info/1112468595/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Chau, Dueng Horng. "Data Mining Meets HCI: Making Sense of Large Graphs." Research Showcase @ CMU, 2012. http://repository.cmu.edu/dissertations/94.

Full text

Abstract:

We have entered the age of big data. Massive datasets are now common in science, government and enterprises. Yet, making sense of these data remains a fundamental challenge. Where do we start our analysis? Where to go next? How to visualize our findings? We answers these questions by bridging Data Mining and Human- Computer Interaction (HCI) to create tools for making sense of graphs with billions of nodes and edges, focusing on: (1) Attention Routing: we introduce this idea, based on anomaly detection, that automatically draws people’s attention to interesting areas of the graph to start thei

APA, Harvard, Vancouver, ISO, and other styles

25

Chamberlain, Benjamin Paul. "Practical challenges of learning and representation for large graphs." Thesis, Imperial College London, 2018. http://hdl.handle.net/10044/1/64783.

Full text

Abstract:

An ever-increasing amount of the humanity's information is being stored in large graphs. The world wide web, digital social networks, e-commerce platforms and chat networks now contain digital traces of the majority of living humans. Many of the most valuable companies ever created are dedicated to organising, managing and extracting useful information from large digital graphs. Machine learning has been shown to be an important tool for automating this task. Discovering scalable machine learning systems, to extract useful information from graphs, is a problem of great practical significance.

APA, Harvard, Vancouver, ISO, and other styles

26

Ramesh, Vinayak. "Messaging for large-scale distributed computation with factor graphs." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/119774.

Full text

Abstract:

Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 91-93).<br>We present a language for generic computation using Factor Graphs, a computationally convenient data structure abstraction that has been popularly utilized for efficient inference in the framework of probabilistic graphical models cf. [22, 15, 30]. We show that message passing over Factor Graphs is Turing-complete. As an important contribution of this work, we show that a Factor

APA, Harvard, Vancouver, ISO, and other styles

27

Trukhanov, Svyatoslav. "Novel approaches for solving large-scale optimization problems on graphs." [College Station, Tex. : Texas A&M University, 2008. http://hdl.handle.net/1969.1/ETD-TAMU-2986.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Vadamalai, Subramanian Viswanathan. "Lost In The Crowd: Are Large Social Graphs Inherently Indistinguishable?" Scholar Commons, 2017. http://scholarcommons.usf.edu/etd/6972.

Full text

Abstract:

Real social graphs datasets are fundamental to understanding a variety of phenomena, such as epidemics, crowd management and political uprisings, yet releasing digital recordings of such datasets exposes the participants to privacy violations. A safer approach to making real social network topologies available is to anonymize them by modifying the graph structure enough as to decouple the node identity from its social ties, yet preserving the graph characteristics in aggregate. At scale, this approach comes with a significant challenge in computational complexity. This thesis questions the nee

APA, Harvard, Vancouver, ISO, and other styles

29

Swartz, Eric Allen. "2-arc transitive polygonal graphs of large girth and valency." The Ohio State University, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=osu1243923530.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Bradonjić, Milan. "Models and tools for large graphs with imposed structural properties." Diss., Restricted to subscribing institutions, 2008. http://proquest.umi.com/pqdweb?did=1750724071&sid=2&Fmt=2&clientId=48051&RQT=309&VName=PQD.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Gosnell, Shannon Leah. "A Characterization of Large (t,r)-Regular Graphs." Digital Commons @ East Tennessee State University, 2000. https://dc.etsu.edu/etd/7.

Full text

Abstract:

A graph G is a (t,r)-regular graph if every collection of t independent vertices is collectively adjacent to exactly r vertices. In this thesis, we will present a complete characterization of (t,r)-regular graphs of order n if n is sufficiently large. Furthermore, we will show that all graphs of this type are isomorphic to Ks + mKp where t(p - 1) + s = r.

APA, Harvard, Vancouver, ISO, and other styles

32

Potamias, Michalis. "Indexing Distances in Large Graphs and Applications in Search Tasks." Boston University Computer Science Department, 2009. https://hdl.handle.net/2144/1721.

Full text

Abstract:

This thesis elaborates on the problem of preprocessing a large graph so that single-pair shortest-path queries can be answered quickly at runtime. Computing shortest paths is a well studied problem, but exact algorithms do not scale well to real-world huge graphs in applications that require very short response time. The focus is on approximate methods for distance estimation, in particular in landmarks-based distance indexing. This approach involves choosing some nodes as landmarks and computing (offline), for each node in the graph its embedding, i.e., the vector of its distances fr

APA, Harvard, Vancouver, ISO, and other styles

33

Li, Ke. "Exploring Topic Evolution in Large Scientific Archives with Pivot Graphs." Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS043.

Full text

Abstract:

Il existe une demande croissante d'outils pratiques pour explorer l'évolution de la recherche scientifique publiée dans des archives bibliographiques telles que le Web of Science, arXiv, PubMed ou ISTEX. L’extraction de topics et de leur évolution à partir de ces archives documentaires a de nombreuses applications et peut être étendue pour synthétiser des récits à partir d'ensembles de documents dans plusieurs domaines, y compris les flux d’actualités, les articles de recherche, les textes juridiques et les œuvres littéraires. Dans cette thèse, nous proposons un modèle de données et un langage

APA, Harvard, Vancouver, ISO, and other styles

34

Kubasch, Madeleine. "Approximation of stochastic models for epidemics on large multi-level graphs." Electronic Thesis or Diss., Institut polytechnique de Paris, 2024. https://theses.hal.science/tel-04717689.

Full text

Abstract:

Nous étudions un modèle SIR à deux niveaux de mélange, à savoir un niveau global uniformément mélangeant, et un niveau local divisé en deux couches de contacts au sein des foyers et lieux de travail, respectivement. Nous cherchons à développer des modèles réduits qui approchent bien cette dynamique épidémique, tout en étant plus maniables pour l’analyse numérique et/ou théorique.D'abord, nous analysons l’impact épidémique de la distribution des tailles des lieux de travail. Notre étude par simulations montre que, si la moyenne de la distribution des tailles de lieux de travail est fixée, sa va

APA, Harvard, Vancouver, ISO, and other styles

35

Mantrach, Amin. "Novel measures on directed graphs and applications to large-scale within-network classification." Doctoral thesis, Universite Libre de Bruxelles, 2010. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210033.

Full text

Abstract:

Ces dernières années, les réseaux sont devenus une source importante d’informations dans différents domaines aussi variés que les sciences sociales, la physique ou les mathématiques. De plus, la taille de ces réseaux n’a cessé de grandir de manière conséquente. Ce constat a vu émerger de nouveaux défis, comme le besoin de mesures précises et intuitives pour caractériser et analyser ces réseaux de grandes tailles en un temps raisonnable.<p>La première partie de cette thèse introduit une nouvelle mesure de similarité entre deux noeuds d’un réseau dirigé et pondéré :la covariance “sum-over-paths”

APA, Harvard, Vancouver, ISO, and other styles

36

Sariaydin, Ayse. "Computation And Analysis Of Spectra Of Large Networks With Directed Graphs." Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/12612249/index.pdf.

Full text

Abstract:

Analysis of large networks in biology, science, technology and social systems have become very popular recently. These networks are mathematically represented as graphs. The task is then to extract relevant qualitative information about the empirical networks from the analysis of these graphs. It was found that a graph can be conveniently represented by the spectrum of a suitable difference operator, the normalized graph Laplacian, which underlies diffusions and random walks on graphs. When applied to large networks, this requires computation of the spectrum of large matrices. The normalized

APA, Harvard, Vancouver, ISO, and other styles

37

Elander, Aman Johan. "Distributed balanced edge-cut partitioning of large graphs having weighted vertices." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-175145.

Full text

Abstract:

Large scale graphs are sometimes too big to store and process on a single machine. Instead, these graphs have to be divided into smaller parts and distributed over several machines, while minimizing the dependency between the different parts. This is known as the graph partitioning problem, which has been shown to be NP-complete. The problem is well studied, however most solutions are either not suitable for a distributed environment or unable to do balanced partitioning of graphs having weighted vertices. This thesis presents an extension to the distributed balanced graph partitioning algorit

APA, Harvard, Vancouver, ISO, and other styles

38

Gurajada, Sairam [Verfasser], and Gerhard [Akademischer Betreuer] Weikum. "Distributed querying of large labeled graphs / Sairam Gurajada ; Betreuer: Gerhard Weikum." Saarbrücken : Saarländische Universitäts- und Landesbibliothek, 2017. http://d-nb.info/1125431903/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Landry, Britton. "Comparing internet probing methodologies through an analysis of large dynamic graphs." Thesis, Monterey, California: Naval Postgraduate School, 2014. http://hdl.handle.net/10945/42669.

Full text

Abstract:

Approved for public release; distribution is unlimited<br>The Internet is an evolving, robust system with built in redundancy to ensure the flow of information regardless of any act of nature or man-made event. This makes mapping the Internet a daunting task, but important because understanding its structure helps identifying vulnerabilities and possibly optimizing traffic through the network. We explore CAIDA’s and NPS’s probing methodologies to verify the assentation that NPS’s probing methodology discovers comparable Internet topologies in less time. We compare these by modeling union of tr

APA, Harvard, Vancouver, ISO, and other styles

40

Arrascue, Ayala Victor Anthony [Verfasser], and Georg [Akademischer Betreuer] Lausen. "Towards an effective consumption of large-scale knowledge graphs for recommendations." Freiburg : Universität, 2020. http://d-nb.info/1223366189/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Zou, Mengchuan. "Aspects of efficiency in selected problems of computation on large graphs." Thesis, Université de Paris (2019-....), 2019. http://www.theses.fr/2019UNIP7132.

Full text

Abstract:

Cette thèse présente trois travaux liés à la conception d’algorithmes efficaces applicables à des graphes de grande taille. Dans le premier travail, nous nous plaçons dans le cadre du calcul centralisé, et ainsi la question de la généralisation des décompositions modulaires et de la conception d’un algorithme efficace pour ce problème. La décomposition modulaire et la détection de module, sont des moyens de révéler et d’analyser les propriétés modulaires de données structurées. Comme la décomposition modulaire classique est bien étudiée et possède un algorithme de temps linéaire optimal, nous

APA, Harvard, Vancouver, ISO, and other styles

42

Saad, Kristen M. "Bulk Synchronous Parallel Implementation of Percolation Centrality for Large Scale Graphs." Case Western Reserve University School of Graduate Studies / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=case149619082195966.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Nadeau, David Robert. "Volume scene graphs : an architecture for large data multi-volume visualization /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2002. http://wwwlib.umi.com/cr/ucsd/fullcit?p3071038.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Erdem, Ozge. "Computation And Analysis Of Spectra Of Large Undirected Networks." Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/12612233/index.pdf.

Full text

Abstract:

Many interacting complex systems in biology, in physics, in technology and social systems, can be represented in a form of large networks. These large networks are mathematically represented by graphs. A graph is represented usually by the adjacency or the Laplacian matrix. Important features of the underlying structure and dynamics of them can be extracted from the analysis of the spectrum of the graphs. Spectral analysis of the so called normalized Laplacian of large networks became popular in the recent years. The Laplacian matrices of the empirical networks are in form of unstructured larg

APA, Harvard, Vancouver, ISO, and other styles

45

Cash, Heather. "A Library of Functions in C++ for Building and Manipulating Large Graphs." Honors in the Major Thesis, University of Central Florida, 2006. http://digital.library.ucf.edu/cdm/ref/collection/ETH/id/1213.

Full text

Abstract:

This item is only available in print in the UCF Libraries. If this is your Honors Thesis, you can help us make it available online for use by researchers around the world by following the instructions on the distribution consent form at http://library.ucf.edu/Systems/DigitalInitiatives/DigitalCollections/InternetDistributionConsentAgreementForm.pdf You may also contact the project coordinator, Kerri Bottorff, at kerri.bottorff@ucf.edu for more information.<br>Bachelors<br>Engineering and Computer Science<br>Computer Science

APA, Harvard, Vancouver, ISO, and other styles

46

Weninger, Timothy Edwards. "Link discovery in very large graphs by constructive induction using genetic programming." Thesis, Manhattan, Kan. : Kansas State University, 2008. http://hdl.handle.net/2097/1087.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Sariyuce, Ahmet Erdem. "Fast Algorithms for Large-Scale Network Analytics." The Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1429825578.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Fröhlich, Jan-Oliver [Verfasser], and Reinhard [Akademischer Betreuer] Diestel. "Linkages in Large Graphs and Matroid Union / Jan-Oliver Fröhlich. Betreuer: Reinhard Diestel." Hamburg : Staats- und Universitätsbibliothek Hamburg, 2014. http://d-nb.info/1051435455/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Meng, Jinghan. "Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs." Scholar Commons, 2017. http://scholarcommons.usf.edu/etd/6900.

Full text

Abstract:

In recent years, the popularity of graph databases has grown rapidly. This paper focuses on single-graph as an effective model to represent information and its related graph mining techniques. In frequent pattern mining in a single-graph setting, there are two main problems: support measure and search scheme. In this paper, we propose a novel framework for constructing support measures that brings together existing minimum-image-based and overlap-graph-based support measures. Our framework is built on the concept of occurrence / instance hypergraphs. Based on that, we present two new support m

APA, Harvard, Vancouver, ISO, and other styles

50

Fröhlich, Jan-Oliver Verfasser], and Reinhard [Akademischer Betreuer] [Diestel. "Linkages in Large Graphs and Matroid Union / Jan-Oliver Fröhlich. Betreuer: Reinhard Diestel." Hamburg : Staats- und Universitätsbibliothek Hamburg, 2014. http://nbn-resolving.de/urn:nbn:de:gbv:18-67361.

Full text

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!