1729 search results - page 185 / 346 » On Bounds for the k-Partitioning of Graphs |
177
click to vote
IM
2007
15 years 6 months ago
2007
Vertex pursuit games, such as the game of Cops and Robbers, are a simplified model for network security. In these games, cops try to capture a robber loose on the vertices of the ...
188
click to vote
JGAA
2007
15 years 6 months ago
2007
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
193
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with m polynomial in n, where each mesh node hosts a processor and a memory module. A...
183
click to vote
SIAMDM
2010
15 years 1 months ago
2010
The domination game played on a graph G consists of two players, Dominator and Staller who alternate taking turns choosing a vertex from G such that whenever a vertex is chosen by...
206
click to vote
COMPGEOM
1992
ACM
15 years 10 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...