803 search results - page 46 / 161 » Independence in Direct-Product Graphs |
167
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
185
click to vote
JMMA
2010
15 years 19 days ago
2010
This paper follows a word-document co-clustering model independently introduced in 2001 by several authors such as I.S. Dhillon, H. Zha and C. Ding. This model consists in creatin...
206
click to vote
CPC
2011
15 years 25 days ago
2011
We study a problem on edge percolation on product graphs G× K2. Here G is any finite graph and K2 consists of two vertices {0, 1} connected by an edge. Every edge in G × K2 is p...
174
click to vote
PPOPP
2012
ACM
14 years 1 months ago
2012
ACM
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
165
click to vote
COMBINATORICA
2006
15 years 5 months ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...