The paper \A Nearly Optimal Oracle for Avoiding Failed Vertices and Edges" by Aaron Bernstein and David Karger lays out a nearly optimal algorithm for nding the shortest distances and paths between vertices with any given single failure in constant time without reconstructing the oracle. Using their paper as a guideline, we have implemented their algorithm in C++ and recorded each step in this thesis. Each step has its own pseudo-code and its own analysis to prove that the entire oracle construction stays within the stated running time and total space bounds, from the authors. The effciency of the algorithm is compared against that of the brute-force methods total running time and total space needed. Using multiple test cases with an increasing number of vertices and edges, we have experimentally validated that their algorithm holds true to their statements of space, running time, and query time.

This study investigated the possibility of procedural generation of skill trees which are similar to skill trees in contemporary video games. A set of randomly-selected skill trees from contemporary video games, from differ- ent game genres, was compiled, and an analysis was performed to extract relevant observations from the set. Using the observations, models for skill tree generation, and for skill tree comparison were proposed, and they were followed for the generation and analysis of the results. It was found that the method of Graph Grammars provided satisfying results compared to the set of skill trees from video games. Additionally, the other methods researched, L-Systems and Naive Randomized Graph Generation, while both may still require improvements discussed in the thesis in order to provide more satis- fying results, they may still be used for particular needs by game designers as they are. 1

<p dir="ltr">In this thesis, we develop an algebraic framework for colored, colored connected, semi-grouplike-flavored, and pathlike co-/bi-/Hopf algebras, which are essential in combinatorics, topology, number theory, and physics. Moreover, we introduce and explore simply colored comonoid, which generalises the notion of colored conilpotent coalgebra. The simply colored structure captures the essence of being connected and give unified treatment of all connected co-/bi-algebras. </p><p dir="ltr">As a consequence, we establish precise conditions for the invertibility of characters essential for renormalization in the Connes-Kreimer formulation, supported by examples from these fields. In order to construct antipodes, we discuss formal localization constructions and quantum deformations. These allow to define and explain the appearance of Brown style coactions. We also investigate the relation between pointed coalgebras and color conilpotent coalgebras. </p><p dir="ltr">Using these results, we interpret all relevant coalgebras through categorical constructions, linking the bialgebra structures to Feynman categories and applying our developed theory in this context. This comprehensive framework provides a robust foundation for future research in mathematical physics and algebra.</p>