Abstract. We present a mathematical model to analyse the establishment and maintenance of communication between mobile agents. We assume that the agents move through a fixed envir...
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
— We present a new representation for individuals in problems that have cyclic permutations as solutions. To demonstrate its usefulness, we analyze a simple randomized local sear...
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...