3211 search results - page 286 / 643 » On the Grundy Number of a Graph |
180
click to vote
ICASSP
2010
IEEE
15 years 6 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...
161
Voted
DAM
2008
15 years 6 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...
189
click to vote
DM
2008
15 years 6 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...
175
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...
202
click to vote
EMNLP
2010
15 years 4 months ago
2010
In state-of-the-art approaches to information extraction (IE), dependency graphs constitute the fundamental data structure for syntactic structuring and subsequent knowledge elici...