3471 search results - page 547 / 695 » Obstacle Numbers of Graphs |
159
click to vote
GD
2005
Springer
15 years 11 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
120
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
We consider generalizations of the k-source sum of vertex eccentricity problem (k-SVET) and the k-source sum of source eccentricity problem (k-SSET) [1], which we call SDET and SSE...
163
click to vote
PAM
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...
175
click to vote
COLT
2003
Springer
15 years 11 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
178
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...