265 search results - page 4 / 53 » Separable Partitions |
STOC
2004
ACM
14 years 9 months ago
2004
ACM
In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree:
MP
1998
13 years 8 months ago
1998
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
CHI
2003
ACM
14 years 9 months ago
2003
ACM
Studies of cursor trajectories can help explain performance differences in "point and click" tasks. As users can have different difficulties with moving the cursor to a ...
BROADNETS
2007
IEEE
14 years 3 months ago
2007
IEEE
—Attacks launched over the Internet have become a pressing problem. Attackers make use of a variety of techniques to anonymize their traffic, in order to escape detection and pr...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract-- We propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. The classic...