Relevant bibliographies by topics / Graph partitioning algorithms / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Graph partitioning algorithms.

Dissertations / Theses on the topic 'Graph partitioning algorithms'

Author: Grafiati
Published: 4 June 2021
Last updated: 13 February 2022

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

Select a source type:

Consult the top 42 dissertations / theses for your research on the topic 'Graph partitioning algorithms.'

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

Mehrotra, Anuj. "Constrained graph partitioning : decomposition, polyhedral structure and algorithms." Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/24234.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Schwartz, Victor Scott. "Dynamic platform-independent meta-algorithms for graph-partitioning." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1998. http://handle.dtic.mil/100.2/ADA356541.

Full text
Abstract:
Thesis (M.S. in Operations Research) Naval Postgraduate School, September 1998.<br>Thesis advisor(s): Gordon H. Bradley. "September 1998." Includes bibliographical references (p. 99-100). Also available online.
APA, Harvard, Vancouver, ISO, and other styles
3

Andersen, Reid. "Local algorithms for graph partitioning and finding dense subgraphs." Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2007. http://wwwlib.umi.com/cr/ucsd/fullcit?p3259059.

Full text
Abstract:
Thesis (Ph. D.)--University of California, San Diego, 2007.<br>Title from first page of PDF file (viewed June 11, 2007). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references (p. 92-95).
APA, Harvard, Vancouver, ISO, and other styles
4

Enciso, Rosa. "Alliances in Graphs: Parameterized Algorithms and on Partitioning Series-Parallel Graphs." Doctoral diss., University of Central Florida, 2009. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/2479.

Full text
Abstract:
Alliances are used to denote agreements between members of a group with similar interests. Alliances can occur between nations, biological sequences, business cartels, and other entities. The notion of alliances in graphs was first introduced by Kristiansen, Hedetniemi, and Hedetniemi in . A defensive alliance in a graph G=(V,E) is a non empty set S&#8838;V S where, for all x &#8712;S, |N&#8745;S|&#8805;|N-S|. Consequently, every vertex that is a member of a defensive alliance has at least as many vertices defending it as there are vertices attacking it. Alliances can be used to model a variet
APA, Harvard, Vancouver, ISO, and other styles
5

Menegola, Bruno. "A study of the k-way graph partitioning problem." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2012. http://hdl.handle.net/10183/67181.

Full text
Abstract:
O problema de particionamento balanceado de grafos consiste em encontrar uma partição de tamanho k dos vértices de um grafo, minimizando o número de arestas que participam do corte tal que o tamanho de nenhuma parte exceda [en~k], para algum e e > [1, k). Essa dissertação estuda esse problema, apresentando uma revisão recente de heurísticas construtivas, heurísticas de refinamento e técnicas multinível. Também propomos um novo algoritmo híbrido para resolver esse problema de particionamento. Nós mostramos como diversas estratégias para construir e aprimorar partições, assim como algumas novas
APA, Harvard, Vancouver, ISO, and other styles
6

Sensen, Norbert. "Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows." [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=971568243.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sinop, Ali Kemal. "Graph Partitioning and Semi-definite Programming Hierarchies." Research Showcase @ CMU, 2012. http://repository.cmu.edu/dissertations/145.

Full text
Abstract:
Graph partitioning is a fundamental optimization problem that has been intensively studied. Many graph partitioning formulations are important as building blocks for divide-and-conquer algorithms on graphs as well as to many applications such as VLSI layout, packet routing in distributed networks, clustering and image segmentation. Unfortunately such problems are notorious for the huge gap between known best known approximation algorithms and hardness of approximation results. In this thesis, we study approximation algorithms for graph partitioning problems using a strong hierarchy of relaxati
APA, Harvard, Vancouver, ISO, and other styles
8

Pardella, Gregor L. [Verfasser]. "Efficient Polynomial-Time Algorithms for Special Graph Partitioning Problems / Gregor L. Pardella." München : Verlag Dr. Hut, 2011. http://d-nb.info/1015604919/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Farrag, Lamis M. "Applications of graph partitioning algorithms to terrain visibility and shortest path problems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ32386.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gadde, Srimanth. "Graph Partitioning Algorithms for Minimizing Inter-node Communication on a Distributed System." University of Toledo / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1376561814.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

El-Darzi, E. "Methods for solving the set covering and set partitioning problems using graph theoretic (relaxation) algorithms." Thesis, Brunel University, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.381678.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Neggazi, Brahim. "Self-stabilizing algorithms for graph parameters." Thesis, Lyon 1, 2015. http://www.theses.fr/2015LYO10041/document.

Full text
Abstract:
Le concept d'auto-stabilisation a été introduit par Dijkstra en 1973. Un système distribué est auto-stabilisant s'il peut démarrer de n'importe quelle configuration initiale et retrouver une configuration légitime en un temps fini par lui-même et sans aucune intervention extérieure. La convergence est également garantie lorsque le système est affecté par des fautes transitoires, ce qui en fait une approche élégante, non masquante, pour la tolérance aux pannes. L'auto-stabilisation a été étudiée dans divers domaines des systèmes distribués tels que les problèmes de synchronisation de l'horloge,
APA, Harvard, Vancouver, ISO, and other styles
13

Ward, Paul. "A Scalable Partial-Order Data Structure for Distributed-System Observation." Thesis, University of Waterloo, 2001. http://hdl.handle.net/10012/1161.

Full text
Abstract:
Distributed-system observation is foundational to understanding and controlling distributed computations. Existing tools for distributed-system observation are constrained in the size of computation that they can observe by three fundamental problems. They lack scalable information collection, scalable data-structures for storing and querying the information collected, and scalable information-abstraction schemes. This dissertation addresses the second of these problems. Two core problems were identified in providing a scalable data structure. First, in spite of the existence of
APA, Harvard, Vancouver, ISO, and other styles
14

Zhang, Ning. "Shortest Path Queries in Very Large Spatial Databases." Thesis, University of Waterloo, 2001. http://hdl.handle.net/10012/1156.

Full text
Abstract:
Finding the shortest paths in a graph has been studied for a long time, and there are many main memory based algorithms dealing with this problem. Among these, Dijkstra's shortest path algorithm is one of the most commonly used efficient algorithms to the non-negative graphs. Even more efficient algorithms have been developed recently for graphs with particular properties such as the weights of edges fall into a range of integer. All of the mentioned algorithms require the graph totally reside in the main memory. Howevery, for very large graphs, such as the digital maps managed by Geogr
APA, Harvard, Vancouver, ISO, and other styles
15

Sau, Ignasi. "Optimization in Graphs under Degree Constraints. Application to Telecommunication Networks." Phd thesis, Université de Nice Sophia-Antipolis, 2009. http://tel.archives-ouvertes.fr/tel-00429092.

Full text
Abstract:
La première partie de cette thèse s'intéresse au groupage de trafic dans les réseaux de télécommunications. La notion de groupage de trafic correspond à l'agrégation de flux de faible débit dans des conduits de plus gros débit. Cependant, à chaque insertion ou extraction de trafic sur une longueur d'onde il faut placer dans le noeud du réseau un multiplexeur à insertion/extraction (ADM). De plus il faut un ADM pour chaque longueur d'onde utilisée dans le noeud, ce qui représente un coût d'équipements important. Les objectifs du groupage de trafic sont d'une part le partage efficace de la bande
APA, Harvard, Vancouver, ISO, and other styles
16

Cunningham, James. "Efficient, Parameter-Free Online Clustering." The Ohio State University, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1606762403895603.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

Kamal, Tariq. "Computational Cost Analysis of Large-Scale Agent-Based Epidemic Simulations." Diss., Virginia Tech, 2016. http://hdl.handle.net/10919/82507.

Full text
Abstract:
Agent-based epidemic simulation (ABES) is a powerful and realistic approach for studying the impacts of disease dynamics and complex interventions on the spread of an infection in the population. Among many ABES systems, EpiSimdemics comes closest to the popular agent-based epidemic simulation systems developed by Eubank, Longini, Ferguson, and Parker. EpiSimdemics is a general framework that can model many reaction-diffusion processes besides the Susceptible-Exposed-Infectious-Recovered (SEIR) models. This model allows the study of complex systems as they interact, thus enabling researchers t
APA, Harvard, Vancouver, ISO, and other styles
18

Ren, Yi. "Indexation et recherche de similarités avec des descripteurs structurés par coupes d'images sur des graphes." Thesis, Bordeaux, 2014. http://www.theses.fr/2014BORD0215/document.

Full text
Abstract:
Dans cette thèse, nous nous intéressons à la recherche d’images similaires avec des descripteurs structurés par découpages d’images sur les graphes.Nous proposons une nouvelle approche appelée “bag-of-bags of words” (BBoW) pour la recherche d’images par le contenu (CBIR). Il s’agit d’une extension du modèle classique dit sac-de-mots (bag of words - BoW). Dans notre approche, une image est représentée par un graphe placé sur une grille régulière de pixels d’image. Les poids sur les arêtes dépendent de caractéristiques locales de couleur et texture. Le graphe est découpé en un nombre fixe de rég
APA, Harvard, Vancouver, ISO, and other styles
19

Mohamed, Sidi Mohamed Ahmed. "K-Separator problem." Thesis, Evry, Institut national des télécommunications, 2014. http://www.theses.fr/2014TELE0032/document.

Full text
Abstract:
Considérons un graphe G = (V,E,w) non orienté dont les sommets sont pondérés et un entier k. Le problème à étudier consiste à la construction des algorithmes afin de déterminer le nombre minimum de nœuds qu’il faut enlever au graphe G pour que toutes les composantes connexes restantes contiennent chacune au plus k-sommets. Ce problème nous l’appelons problème de k-Séparateur et on désigne par k-séparateur le sous-ensemble recherché. Il est une généralisation du Vertex Cover qui correspond au cas k = 1 (nombre minimum de sommets intersectant toutes les arêtes du graphe)<br>Let G be a vertex-wei
APA, Harvard, Vancouver, ISO, and other styles
20

Althoby, Haeder Younis Ghawi. "Theoritical and numerical studies on the graph partitioning problem." Thesis, Normandie, 2017. http://www.theses.fr/2017NORMC233/document.

Full text
Abstract:
Étant donné G = (V, E) un graphe non orienté connexe et un entier positif β (n), où n est le nombrede sommets de G, le problème du séparateur (VSP) consiste à trouver une partition de V en troisclasses A, B et C de sorte qu'il n'y a pas d'arêtes entre A et B, max {| A |, | B |} est inférieur ou égal àβ (n) et | C | est minimum. Dans cette thèse, nous considérons une modélisation du problème sous laforme d'un programme linéaire en nombres entiers. Nous décrivons certaines inégalités valides et etdéveloppons des algorithmes basés sur un schéma de voisinage.Nous étudions également le problème du
APA, Harvard, Vancouver, ISO, and other styles
21

Lu, Zhi. "Optimization approaches for minimum conductance graph partitioning." Thesis, Angers, 2020. http://www.theses.fr/2020ANGE0013.

Full text
Abstract:
Le problème de partitionnement de graphe de conductance minimale (MCGPP) est un problème d’optimisation combinatoire NP-difficile avec de nombreuses applications pratiques dans divers domaines tels que la détection communautaire, la bioinformatique et la vision par ordinateur. Etant donnée sa complexité intrinsèque, des approches heuristiques et métaheuristiques constituent un moyen convenable pour résoudre des instances de grande taille. Cette thèse est consacrée au développement d’algorithmes métaheuristiques performants pour le MC-GPP. Plus précisément, nous proposons un algorithme «Stagnat
APA, Harvard, Vancouver, ISO, and other styles
22

Zanetti, Luca. "Algorithms for partitioning well-clustered graphs." Thesis, University of Bristol, 2018. http://hdl.handle.net/1983/e6ba8929-6488-4277-b91b-4f4f7eda2b26.

Full text
Abstract:
Graphs occurring in the real world usually exhibit a high level of order and organisation: higher concentration of edges within the same group of vertices, and lower concentration among different groups. A common way to analyse these graphs is to partition the vertex set of a graph into clusters according to some connectivity measure. Graph clustering has been widely applied to many fields of computer science, from machine learning to bioinformatics and social network analysis. The focus of this thesis is to design and analyse algorithms for partitioning graphs presenting a strong cluster-stru
APA, Harvard, Vancouver, ISO, and other styles
23

Enciso, Rosa I. "Alliances in graphs parameterized algorithms and on partitioning series-parallel graphs /." Orlando, Fla. : University of Central Florida, 2009. http://purl.fcla.edu/fcla/etd/CFE0002956.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Ozsoy, Feyzullah Aykut. "An integer programming approach to layer planning in communication networks." Doctoral thesis, Universite Libre de Bruxelles, 2011. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209935.

Full text
Abstract:
In this thesis, we introduce the Partitioning-Hub Location-Routing problem (PHLRP), which can be classified as a variant of the hub location problem.<p>PHLRP consists of partitioning a network into sub-networks, locating at least one hub in each subnetwork and routing the traffic within the network such that all inter-subnetwork traffic is routed through the hubs and all intra-subnetwork traffic stays within the sub-networks all the way from the source to the destination. Obviously, besides the hub location component, PHLRP also involves a graph partitioning component and a routing component.
APA, Harvard, Vancouver, ISO, and other styles
25

Schreiber, Georg R. "Systèmes désordonnés et frustrés: modèles champ moyen et problèmes d'optimisation combinatoire." Phd thesis, Université Paris Sud - Paris XI, 1997. http://tel.archives-ouvertes.fr/tel-00000825.

Full text
Abstract:
Dans la présente thèse de doctorat je présente des résultats concernant des modèles désordonnés et frustrés venant de la physique statistique et de l'optimisation combinatoire. Comme application de la théorie des verres de spins, j'étudie le modèle de Blume, Emery et Griffiths désordonné et frustré. Ce modèle est traité dans l'approximation de champ moyen dans le cadre de la méthode des répliques A l'aide de l'Ansatz symétrique dans les répliques je présente une solution numérique complète puis je discute des effets de brisure de cette symétrie La stabilité de la solution symétrique a été Rudi
APA, Harvard, Vancouver, ISO, and other styles
26

Omeroglu, Nurettin Burak. "K-way Partitioning Of Signed Bipartite Graphs." Master's thesis, METU, 2012. http://etd.lib.metu.edu.tr/upload/12614817/index.pdf.

Full text
Abstract:
Clustering is the process in which data is differentiated, classified according to some criteria. As a result of partitioning process, data is grouped into clusters for specific purpose. In a social network, clustering of people is one of the most popular problems. Therefore, we mainly concentrated on finding an efficient algorithm for this problem. In our study, data is made up of two types of entities (e.g., people, groups vs. political issues, religious beliefs) and distinct from most previous works, signed weighted bipartite graphs are used to model relations among them. For the partitioni
APA, Harvard, Vancouver, ISO, and other styles
27

Queyroi, François. "Partitionnement de grands graphes : mesures, algorithmes et visualisation." Thesis, Bordeaux 1, 2013. http://www.theses.fr/2013BOR14863/document.

Full text
Abstract:
L'analyse de réseaux (représentés par des graphes) est une composante importante dans la compréhension de systèmes complexes issus de nombreuses disciplines telles que la biologie, la géographie ou la sociologie. Nous nous intéressons dans cette thèse aux décompositions de ces réseaux. Ces décompositions sont utiles pour la compression des données, la détection de communautés ou la visualisation de graphes. Une décomposition possible est un partitionnement hiérarchique des sommets du graphe. Nous traitons de l'évaluation de la qualité de telles structures (leur capacité à bien capturer la topo
APA, Harvard, Vancouver, ISO, and other styles
28

Trivedi, Shubhendu. "A Graph Theoretic Clustering Algorithm based on the Regularity Lemma and Strategies to Exploit Clustering for Prediction." Digital WPI, 2012. https://digitalcommons.wpi.edu/etd-theses/573.

Full text
Abstract:
The fact that clustering is perhaps the most used technique for exploratory data analysis is only a semaphore that underlines its fundamental importance. The general problem statement that broadly describes clustering as the identification and classification of patterns into coherent groups also implicitly indicates it's utility in other tasks such as supervised learning. In the past decade and a half there have been two developments that have altered the landscape of research in clustering: One is improved results by the increased use of graph theoretic techniques such as spectral clustering
APA, Harvard, Vancouver, ISO, and other styles
29

Mazouzi, Houssemeddine. "Algorithmes pour le déchargement de tâches sur serveurs de périphérie." Thesis, Paris 13, 2019. http://www.theses.fr/2019PA131076.

Full text
Abstract:
Le déchargement de calculs est l’une des solutions les plus prometteuses pour surmonter le manque d e ressources au niveau des terminaux mobiles. Elle permet l’exécution d’une partie ou de la totalité d’une application mobile dans le cloud. L’objectif est d’améliorer les temps d’exécution et de réduire la consommation énergétique. Malheureusement, le cloud est généralement éloignés des équipements terminaux. Ce qui rend cette approche souffrir de délais importants et fluctuants. Cela est particulièrement problématique pour certaines applications pour lesquelles un temps de réponse réduit est n
APA, Harvard, Vancouver, ISO, and other styles
30

Rodrigues, Edilson José. "Um algoritmo para o Problema do Isomorfismo de Grafos." reponame:Repositório Institucional da UFABC, 2014.

Find full text
Abstract:
Orientador: Prof. Dr. Daniel Morgato Martin<br>Dissertação (mestrado) - Universidade Federal do ABC, Programa de Pós-Graduação em Ciências da Computação, 2014.<br>Neste trabalho estudamos o Problema do Isomorfismo de Grafos e a sua complexidade para resolvê-lo. Nossa principal contribuição é a proposta de um algoritmo para o caso geral do Problema, baseado no particionamento do conjunto de vértices e em emparelhamentos perfeitos de grafos bipartidos. Estudamos também o algoritmo de Brendan McKay, que é o mais rápido algoritmo para o Problema do Isomorfismo de Grafos conhecido. Ao final, implem
APA, Harvard, Vancouver, ISO, and other styles
31

Liu, Zifan. "Complex systems and health systems, computational challenges." Thesis, Versailles-St Quentin en Yvelines, 2015. http://www.theses.fr/2015VERS001V/document.

Full text
Abstract:
Le calcul des valeurs propres intervient dans des modèles de maladies d’épidémiques et pourrait être utilisé comme un allié des campagnes de vac- cination dans les actions menées par les organisations de soins de santé. La modélisation épidémique peut être considérée, par analogie, comme celle des viruses d’ordinateur qui dépendent de l’état de graphe sous-jacent à un moment donné. Nous utilisons PageRank comme méthode pour étudier la propagation de l’épidémie et d’envisager son calcul dans le cadre de phé- nomène petit-monde. Une mise en œuvre parallèle de méthode multiple de "implicitly rest
APA, Harvard, Vancouver, ISO, and other styles
32

Tu, Chih-Chien, and 涂志堅. "Eigenspace Relaxation Algorithms for Graph Partitioning Problems." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/44385225322425092988.

Full text
Abstract:
博士<br>國立成功大學<br>電機工程學系<br>89<br>Graph partitioning problems are NP-hard problems and very important in VLSI design. We study relations among several eigenvalue bounds and algorithms for graph partitioning problems. We show an equivalence relation between graph partitioning and quadratic assignment problem. Hence, to solve the quadratic assignment problem is equivalent to solve its corresponding graph partitioning problem. Also, we design an algorithm for the problems which performs the following: first it computes the k largest eigenvalues of the affine symmetric matrix function to attain Don
APA, Harvard, Vancouver, ISO, and other styles
33

Ahmed, Aly. "Complex graph algorithms using relational database." Thesis, 2021. http://hdl.handle.net/1828/13306.

Full text
Abstract:
Data processing for Big Data plays a vital role for decision-makers in organizations and government, enhances the user experience, and provides quality results in prediction analysis. However, many modern data processing solutions make a significant investment in hardware and maintenance costs, such as Hadoop and Spark, often neglecting the well established and widely used relational database management systems (RDBMS's). In this dissertation, we study three fundamental graph problems in RDBMS. The first problem we tackle is computing shortest paths (SP) from a source to a target in large n
APA, Harvard, Vancouver, ISO, and other styles
34

Kamiński, Marcin Jakub. "New algorithmic and hardness results for graph partitioning problems." 2007. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13472.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Mandal, Aritra. "Distributed graph decomposition algorithms on Apache Spark." Thesis, 2018. https://doi.org/10.7912/C2C08W.

Full text
Abstract:
Indiana University-Purdue University Indianapolis (IUPUI)<br>Structural analysis and mining of large and complex graphs for describing the characteristics of a vertex or an edge in the graph have widespread use in graph clustering, classification, and modeling. There are various methods for structural analysis of graphs including the discovery of frequent subgraphs or network motifs, counting triangles or graphlets, spectral analysis of networks using eigenvectors of graph Laplacian, and finding highly connected subgraphs such as cliques and quasi cliques. Unfortunately, the algorithms for
APA, Harvard, Vancouver, ISO, and other styles
36

Sensen, Norbert [Verfasser]. "Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows / von Norbert Sensen." 2003. http://d-nb.info/971568243/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Portugal, David Bina Siassipour. "RoboCops: a study of coordination algorithms for autonomous mobile robots in patrolling missions." Master's thesis, 2009. http://hdl.handle.net/10316/27060.

Full text
Abstract:
Dissertação de Mestrado em Engenharia Electrotécnica e de Computadores, apresentada à Faculdade de Ciências e Tecnologia da Universidade de Coimbra<br>Nowadays, the evolution in the robotics eld allows to free human beings in a set of tasks, mainly the most monotonous and repetitive or, eventually, with dangerous concerns. One of these tasks is the patrolling task in infrastructures. The development and conception of patrolling methods using mobile robots is a scienti c area which has a growing interest. This work focuses on patrolling algorithms for teams of mobile robots endowed with th
APA, Harvard, Vancouver, ISO, and other styles
38

Wang, Lyu Wei, and 王閭威. "BiFennel: Fast Bipartite Graph Partitioning Algorithm for Big Data." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/wu5heb.

Full text
Abstract:
碩士<br>國立清華大學<br>資訊系統與應用研究所<br>103<br>Cloud computing is widely utilized in today’s internet service, which severely requires the ability of processing graphs of billion vertices rapidly in the situation such as social network analyze, bio-informational network analyze and semantic processing. Therefore, graph processing has a significant role in the research and development of high-performance computing. However, many problems such as music and movie recommendation web, LDA topic model can be solved by modeling these data into bipartite graph and computing it with graph processing engines. As
APA, Harvard, Vancouver, ISO, and other styles
39

Brasão, Osvaldo Venda. "Redes de troca de informação aplicadas a tarefas de optimização." Doctoral thesis, 2013. http://hdl.handle.net/10400.2/3105.

Full text
Abstract:
Tese de Doutoramento em Gestão na especialidade em Gestão de Informação apresentada à Universidade Aberta<br>Esta tese estuda a aplicação da teoria do equilíbrio estrutural das redes sociais a tarefas práticas. O estudo do equilíbrio estrutural é uma linha de investigação da sociologia matemática dedicada à análise dos processos de estabilização das relações dos indivíduos quando ocorre uma divergência na avaliação de uma mesma fonte de informação. Existe uma longa discussão sobre qual o modelo dinâmico que adequadamente descreve essa estabilização. É demonstrado que as regras originalmente
APA, Harvard, Vancouver, ISO, and other styles
40

Kuo, Jung-Yu, and 郭榮裕. "The Development of an Efficient Planar Craph Embedding Algorithm for Graph Partitioning." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/52435796258457005542.

Full text
Abstract:
碩士<br>逢甲大學<br>自動控制工程學系<br>85<br>Vertex partitioning of graphs is applied to the "divide-and-conquer" approaches for solving combinatorial problems. The underlying concept in the method is to divide the original problem into independent multiple subproblems for roughly the same size. The subproblems are then solved recursively and combined to provide a solution to the large problem. The planar separator theorem of Lipton and Tarjan provides a basis of this approach. However, there is a "bottleneck" in the process of partitioning a very large graph, this bottleneck appears in the planarity t
APA, Harvard, Vancouver, ISO, and other styles
41

Pecsők, Ján. "Algoritmy pro řezy v grafech." Master's thesis, 2014. http://www.nusl.cz/ntk/nusl-323051.

Full text
Abstract:
Graph-partitioning problems can be generically defined as a family of problems in which we are asked to partition a graph into two or more components. We present overview of methods and concepts used to find best graph partitions according to several criteria. We prove duality of multi-commodity flow and sparsest cut problem due to work of Leighton and Rao by describing algorithm using a Linear programming relaxation and a geometric embedding. Then we present the work of Arora, Rao and Vazirani (ARV) and their algorithm based on Semidefinite programming relaxation and a geometric embedding. We
APA, Harvard, Vancouver, ISO, and other styles
42

Mishra, Ashirbad. "Efficient betweenness Centrality Computations on Hybrid CPU-GPU Systems." Thesis, 2016. http://hdl.handle.net/2005/2718.

Full text
Abstract:
Analysis of networks is quite interesting, because they can be interpreted for several purposes. Various features require different metrics to measure and interpret them. Measuring the relative importance of each vertex in a network is one of the most fundamental building blocks in network analysis. Between’s Centrality (BC) is one such metric that plays a key role in many real world applications. BC is an important graph analytics application for large-scale graphs. However it is one of the most computationally intensive kernels to execute, and measuring centrality in billion-scale graphs is
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!

To the bibliography