21 search results - page 1 / 5 » Minimal comparability completions of arbitrary graphs |
DAM
2008
13 years 4 months ago
2008
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of th...
IPL
2008
13 years 4 months ago
2008
Given an arbitrary graph G = (V, E) and a proper interval graph H = (V, F) with E F we say that H is a proper interval completion of G. The graph H is called a minimal proper inte...
ESA
2005
Springer
13 years 10 months ago
2005
Springer
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means ...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
ICRA
2010
IEEE
13 years 3 months ago
2010
IEEE
— The problem of coverage of known space by a mobile robot has many applications. Of particular interest is providing a solution that guarantees the complete coverage of the free...