1105 search results - page 118 / 221 » Linear choosability of graphs |
142
click to vote
ACSC
2009
IEEE
15 years 11 months ago
2009
IEEE
Most text mining methods are based on representing documents using a vector space model, commonly known as a bag of word model, where each document is modeled as a linear vector r...
135
click to vote
PAMI
2007
15 years 4 months ago
2007
—Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different soluti...
131
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
165
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
141
click to vote
ANOR
2005
15 years 4 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...