Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
A (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between...
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
M. Fatih Demirci, Ali Shokoufandeh, Sven J. Dickin...
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into ...
Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaqu...