Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Walliser, Fabian"'
A (fully) dynamic graph algorithm is a data structure that supports edge insertions, edge deletions, and answers specific queries pertinent to the problem at hand. In this work, we address the fully dynamic edge orientation problem, also known as the
Externí odkaz:
http://arxiv.org/abs/2407.12595
