3204 search results - page 212 / 641 » The Alcuin Number of a Graph |
136
click to vote
EJC
2008
15 years 6 months ago
2008
Let denote a distance-regular graph with classical parameters (D, b, , ) and D 3. Assume the intersection numbers a1 = 0 and a2 = 0. We show is 3-bounded in the sense of the ar...
167
click to vote
TCS
2008
15 years 6 months ago
2008
Graph searching encompasses a wide variety of combinatorial problems related to the problem of capturing a fugitive residing in a graph using the minimum number of searchers. In t...
142
click to vote
HICSS
2008
IEEE
16 years 17 days ago
2008
IEEE
The number of publications in biomedicine is increasing enormously each year. To help researchers digest the information in these documents, text mining tools are being developed ...
158
click to vote
CLUSTER
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...
154
click to vote
JCT
2010
15 years 4 months ago
2010
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...