WG
2010
Springer
13 years 9 months ago
2010
Springer
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...
WG
2010
Springer
13 years 9 months ago
2010
Springer
Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in schedu...
WG
2010
Springer
13 years 9 months ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
WG
2010
Springer
13 years 9 months ago
2010
Springer
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...
WG
2010
Springer
13 years 9 months ago
2010
Springer
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...
WG
2010
Springer
13 years 9 months ago
2010
Springer
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,...
WG
2010
Springer
13 years 9 months ago
2010
Springer
WG
2010
Springer
13 years 9 months ago
2010
Springer
WG
2010
Springer
13 years 9 months ago
2010
Springer
We consider right angle crossing (RAC) drawings of graphs in which the edges are represented by polygonal arcs and any two edges can cross only at a right angle. We show that if a ...
WG
2010
Springer
13 years 9 months ago
2010
Springer
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...