83 search results - page 4 / 17 » Solving Coverage Problems with Embedded Graph Grammars |
GD
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
JDA
2006
13 years 7 months ago
2006
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
ICRA
2008
IEEE
14 years 1 months ago
2008
IEEE
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
GD
2009
Springer
13 years 11 months ago
2009
Springer
In this paper, we explore a new convention for drawing graphs, the (Manhattan-) geodesic drawing convention. It requires that edges are drawn as interior-disjoint monotone chains o...
CSLP
2004
Springer
13 years 10 months ago
2004
Springer
Many tasks in computational linguistics can be regarded as configuration problems. In this paper, we introduce the notion of lexicalised multi-dimensional configuration problems (l...