Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Setzer, Alexander"'
We consider the problem of transforming a given graph $G_s$ into a desired graph $G_t$ by applying a minimum number primitives from a particular set of local graph transformation primitives. These primitives are local in the sense that each node can
Externí odkaz:
http://arxiv.org/abs/1904.11395
A fundamental problem for overlay networks is to safely exclude leaving nodes, i.e., the nodes requesting to leave the overlay network are excluded from it without affecting its connectivity. To rigorously study self-tabilizing solutions to this prob
Externí odkaz:
http://arxiv.org/abs/1809.05013
We present a self-stabilizing protocol for an overlay network that constructs the Minimum Spanning Tree (MST) for an underlay that is modeled by a weighted tree. The weight of an overlay edge between two nodes is the weighted length of their shortest
Externí odkaz:
http://arxiv.org/abs/1809.02436
We study the consensus problem in a synchronous distributed system of $n$ nodes under an adaptive adversary that has a slightly outdated view of the system and can block all incoming and outgoing communication of a constant fraction of the nodes in e
Externí odkaz:
http://arxiv.org/abs/1805.00774
We propose a distributed protocol for a queue, called \textsc{Skueue}, which spreads its data fairly onto multiple processes, avoiding bottlenecks in high throughput scenarios. \textsc{Skueue} can be used in highly dynamic environments, through the a
Externí odkaz:
http://arxiv.org/abs/1802.07504
For overlay networks, the ability to recover from a variety of problems like membership changes or faults is a key element to preserve their functionality. In recent years, various self-stabilizing overlay networks have been proposed that have the ad
Externí odkaz:
http://arxiv.org/abs/1607.05165
Distributed applications are commonly based on overlay networks interconnecting their sites so that they can exchange information. For these overlay networks to preserve their functionality, they should be able to recover from various problems like m
Externí odkaz:
http://arxiv.org/abs/1512.06593
We present a factor $14D^2$ approximation algorithm for the minimum linear arrangement problem on series-parallel graphs, where $D$ is the maximum degree in the graph. Given a suitable decomposition of the graph, our algorithm runs in time $O(|E|)$ a
Externí odkaz:
http://arxiv.org/abs/1410.4395
In this work we present the first distributed storage system that is provably robust against crash failures issued by an adaptive adversary, i.e., for each batch of requests the adversary can decide based on the entire system state which servers will
Externí odkaz:
http://arxiv.org/abs/1409.4991
Autor:
Setzer, Alexander
In various research papers, such as [2], one will find the claim that the minLA is optimally solvable on outerplanar graphs, with a reference to [1]. However, the problem solved in that publication, which we refer to as the planar minimum linear arra
Externí odkaz:
http://arxiv.org/abs/1409.1005