3204 search results - page 383 / 641 » The Alcuin Number of a Graph |
184
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
Recently, the Sparse Matrix Transform (SMT) has been proposed as a tool for estimating the eigen-decomposition of high dimensional data vectors [1]. The SMT approach has two major...
165
click to vote
DAM
2008
15 years 7 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
196
Voted
DM
2008
15 years 7 months ago
2008
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...
182
click to vote
JCO
2007
15 years 6 months ago
2007
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V (G) is an m-tuple dominating set if S dominates every vertex of G at least m times, and an m-dominating...
151
click to vote
APSEC
1997
IEEE
15 years 11 months ago
1997
IEEE
A task-type in concurrent programs is a template of task-instances which are dynamically generated in execution of the programs. The number of the generated taskinstances may not ...