Log in

Relevant bibliographies by topics / Graph partitioning algorithms

Contents

Dissertations / Theses

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Dissertations / Theses on the topic "Graph partitioning algorithms"

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⊆V S where, for all x ∈S, |N∩S|≥|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

More sources

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!