We tackle the problem of data-structure rewriting including global and local pointer redirections. Each basic rewrite step may perform three kinds of actions: (i) Local redirectio...
Abstract— Scalable network localization is key for realizing ad-hoc networks. In this paper we propose a localization scheme where nodes form a relative coordinate system of the ...
Jayasri Akella, Murat Yuksel, Shivkumar Kalyanaram...
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...
Graph visualization systems often exploit opaque metanodes to reduce visual clutter and improve the readability of large graphs. This filtering can be done in a path-preserving wa...
Daniel Archambault, Helen C. Purchase, Bruno Pinau...
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...