1149 search results - page 229 / 230 » Minimally non-Pfaffian graphs |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
BMCBI
2006
13 years 6 months ago
2006
Background: Biological processes are mediated by networks of interacting genes and proteins. Efforts to map and understand these networks are resulting in the proliferation of int...
CGA
2007
13 years 6 months ago
2007
abstract painting and practice can benefit information visualization—even though the two fields have significantly different objectives. This comparison reflects the spirit of ...