Please use this identifier to cite or link to this item: http://hdl.handle.net/2445/152313
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorBenseny, Antoni-
dc.contributor.authorSan Martı́n Pons, Marc de-
dc.date.accessioned2020-03-11T09:31:04Z-
dc.date.available2020-03-11T09:31:04Z-
dc.date.issued2019-06-20-
dc.identifier.urihttp://hdl.handle.net/2445/152313-
dc.descriptionTreballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2019, Director: Antoni Bensenyca
dc.description.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.ca
dc.format.extent40 p.-
dc.format.mimetypeapplication/pdf-
dc.language.isocatca
dc.rightscc-by-nc-nd (c) Marc de San Martı́n Pons, 2019-
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/*
dc.sourceTreballs Finals de Grau (TFG) - Matemàtiques-
dc.subject.classificationArbres (Teoria de grafs)ca
dc.subject.classificationTreballs de fi de grau-
dc.subject.classificationAlgorismes computacionalsca
dc.subject.otherTrees (Graph theory)en
dc.subject.otherBachelor's theses-
dc.subject.otherComputer algorithmsen
dc.titleDescomposició de grafs en components i blocs: anàlisi, simulacions i aplicacionsca
dc.typeinfo:eu-repo/semantics/bachelorThesisca
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessca
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