803 search results - page 41 / 161 » Independence in Direct-Product Graphs |
144
Voted
EUROPAR
1998
Springer
15 years 7 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...
133
click to vote
RSA
2011
14 years 10 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...
160
click to vote
IWPEC
2009
Springer
15 years 10 months 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...
RECOMB
2005
Springer
16 years 4 months ago
2005
Springer
We study properties of multidomain proteins from a graph theoretical perspective. In particular, we demonstrate connections between properties of the domain overlap graph and certa...
126
click to vote
COMBINATORICS
2006
15 years 3 months ago
2006
A spanning tree T in a finite planar connected graph G determines a dual spanning tree T in the dual graph G such that T and T do not intersect. We show that it is not always poss...