1461 search results - page 142 / 293 » Complexity of Graph Covering Problems |
FCS
2009
14 years 7 months ago
2009
- A representation for a set is defined to be symmetric if the space required for the representation of the set is the same as the space required for representation of the set'...
SIAMDM
2008
14 years 10 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
ISPD
2010
ACM
15 years 5 months ago
2010
ACM
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
117
click to vote
SMA
2009
ACM
15 years 4 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
109
click to vote
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...