540 search results - page 44 / 108 » New bounds on the edge number of a k-map graph |
SIROCCO
2007
13 years 10 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...
IPPS
2002
IEEE
14 years 1 months ago
2002
IEEE
In this paper, we propose a new distributed algorithm that constructs a sparse spanner subgraph of the unit disk graph efficiently for wireless ad hoc networks. It maintains a li...
AE
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...