Please use this identifier to cite or link to this item:
Title: Enumerating k-connected orientations
Author: Yarema, Taras
Director/Tutor: Knauer, Kolja
Keywords: Programació (Matemàtica)
Treballs de fi de grau
Teoria de grafs
Algorismes computacionals
Mathematical programming
Bachelor's theses
Graph theory
Computer algorithms
Issue Date: 24-Jan-2021
Abstract: [en] This thesis aims to study an enumeration algorithm for the k-connected orientations of a given graph, both from the theoretic perspective as well as in terms of implementation. The latter had not been done before. The process has been divided into two parts. Firstly, generating a first k-connected orientation from a 2k-connected multi-graph, and secondly using the enumeration algorithms presented by Blind, Knauer and Valicov. Finally, for the computational part, a SageMath library with the implementation is presented, to generate the entire set of k-connected orientations, with a planned SageMath core contribution.
Note: Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2021, Director: Kolja Knauer
Appears in Collections:Treballs Finals de Grau (TFG) - Matemàtiques

Files in This Item:
File Description SizeFormat 
tfg_taras_yarema.pdfMemòria1.08 MBAdobe PDFView/Open

This item is licensed under a Creative Commons License Creative Commons