83 citations · 346 across the 78 of their papers we have counts for
4 papers · 1 filter
On the Maximum Density of Graphs with Good Edge-Labellings
Abbas Mehrabian, Dieter Mitsche, Paweł Prałat
A good edge-labelling of a simple, finite graph is a labelling of its edges with real numbers such that, for every ordered pair of vertices (u,v), there is at most one nondecreasin…
Metric dimension for random graphs
B. Bollobas, D. Mitsche, P. Pralat
The metric dimension of a graph is the minimum number of vertices in a subset of the vertex set of such that all other vertices are uniquely determined by their distanc…
Revolutionaries and spies on random graphs
Dieter Mitsche, Pawel Pralat
Pursuit-evasion games, such as the game of Revolutionaries and Spies, are a simplified model for network security. In the game we consider in this paper, a team of revolutionar…
Cops and Invisible Robbers: the Cost of Drunkenness
Athanasios Kehagias, Dieter Mitsche, Pawel Pralat
We examine a version of the Cops and Robber (CR) game in which the robber is invisible, i.e., the cops do not know his location until they capture him. Apparently this game (CiR) h…