Motivated by questions in computer vision and sensor networks, Alpert et al. [3] introduced the following definitions. Given a graph G, an obstacle representation of G is a set of...
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlo...
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to fi...
Steven Chaplick, Marisa Gutierrez, Benjamin L&eacu...
Tactile and haptic interaction is becoming increasingly important and ergonomic standards can ensure that systems are designed with sufficient concerns for ergonomics and interoper...
Jan B. F. van Erp, Ki-Uk Kyung, Sebastian Kassner,...
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...