Amb motiu del tancament d'estiu, la validació de documents es reprendrà a partir del 28 d'agost de 2026. Disculpeu les molèsties.
Con motivo del cierre de verano, la validación de documentos se reanudará a partir del 28 de agosto de 2026. Disculpad las molestias
Due to the summer closure, document validation will resume starting August 28, 2026. We apologize for any inconvenience.

Files

tfg_taras_yarema.pdf (1.06 MB)

Document type

Bachelor thesis

Publication date

2021-01-24

Publication license

cc-by-nc-nd (c) Taras Yarema, 2021
Please use this identifier to cite or link to this item: https://hdl.handle.net/2445/181993

Enumerating k-connected orientations

Journal Title

Authors

Director/Tutor

Journal ISSN

Volume Title

Related resource

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.

Description

Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2021, Director: Kolja Knauer

Subject

Programació (Matemàtica), Treballs de fi de grau, Teoria de grafs, Algorismes computacionals

Subject (English)

Mathematical programming, Bachelor's theses, Graph theory, Computer algorithms

Citation

Collections

Treballs Finals de Grau (TFG) - Matemàtiques

Citation

YAREMA, Taras. Enumerating k-connected orientations. [consulted: 9 of August of 2026]. Available at: https://hdl.handle.net/2445/181993

Export metadata

JSON - METS

Share record