Please use this identifier to cite or link to this item: http://hdl.handle.net/2445/152313
Title: Descomposició de grafs en components i blocs: anàlisi, simulacions i aplicacions
Author: San Martı́n Pons, Marc de
Director/Tutor: Benseny, Antoni
Keywords: Arbres (Teoria de grafs)
Treballs de fi de grau
Algorismes computacionals
Trees (Graph theory)
Bachelor's thesis
Computer algorithms
Issue Date: 20-Jun-2019
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.
Note: Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2019, Director: Antoni Benseny
URI: http://hdl.handle.net/2445/152313
Appears in Collections:Treballs Finals de Grau (TFG) - Matemàtiques

Files in This Item:
File Description SizeFormat 
152313.pdfMemòria647.8 kBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons