3008 search results - page 140 / 602 » Independence in connected graphs |
178
click to vote
EUROPAR
1998
Springer
15 years 10 months ago
1998
Springer
This paper illustrates the use of a post-mortem call-graph profiling tool in the analysis of an SQL query processing application written using BSPIib [4]. Unlike other parallel pro...
169
click to vote
RSA
2011
15 years 1 months ago
2011
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
204
click to vote
IWPEC
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
166
click to vote
INFOCOM
2006
IEEE
16 years 13 days ago
2006
IEEE
— In the standard approach to studying connectivity, a physical layer is assumed that allows direct transmission between neighbors within some fixed distance. The graph resultin...
152
click to vote
LADC
2007
Springer
16 years 17 days ago
2007
Springer
A distributed dynamic system is a fully distributed system subject to a continual arrival/departure of the entities defining the system. Another characterizing dimension of these ...