187 search results - page 14 / 38 » The Number of Independent Sets in a Grid Graph |
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a mathematical model to analyse the establishment and maintenance of communication between mobile agents. We assume that the agents move through a fixed envir...
GD
2004
Springer
14 years 29 days ago
2004
Springer
The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points in the n × n grid with no three points collinear. In 1951, Erd¨os proved that t...
ICALP
2003
Springer
14 years 23 days ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
GD
2004
Springer
14 years 29 days ago
2004
Springer
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
SPAA
2010
ACM
14 years 11 days ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...