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

152313.pdf (647.8 KB)

Document type

Bachelor thesis

Publication date

2019-06-20

Publication license

cc-by-nc-nd (c) Marc de San Martı́n Pons, 2019
Please use this identifier to cite or link to this item: https://hdl.handle.net/2445/152313

Descomposició de grafs en components i blocs: anàlisi, simulacions i aplicacions

Journal Title

Authors

Director/Tutor

Journal ISSN

Volume Title

Related resource

Abstract

[en] A block of a graph is a connected subgraph which does not contain any articulation point. A strongly connected component of a directed graph is a subraph in which every vertex is reachable from every other vertex in the subgraph through an oriented path. This project consists in applying extensions on search algorithms in order to detect blocks and strongly connected components in graphs and directed graphs respectively, and implement them in a computer program with a visual environment.

Description

Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2019, Director: Antoni Benseny

Subject

Arbres (Teoria de grafs), Treballs de fi de grau, Algorismes computacionals

Subject (English)

Trees (Graph theory), Bachelor's theses, Computer algorithms

Citation

Collections

Treballs Finals de Grau (TFG) - Matemàtiques

Citation

SAN MARTÍN PONS, Marc de. Descomposició de grafs en components i blocs: anàlisi, simulacions i aplicacions. [consulted: 9 of August of 2026]. Available at: https://hdl.handle.net/2445/152313

Export metadata

JSON - METS

Share record