3267 search results - page 159 / 654 » Generalized quasirandom graphs |
120
click to vote
ENDM
2007
15 years 4 months ago
2007
For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having ...
145
click to vote
JMLR
2010
14 years 11 months ago
2010
Causal learning methods are often evaluated in terms of their ability to discover a true underlying directed acyclic graph (DAG) structure. However, in general the true structure ...
135
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
Algorithms based on the minimization of the Total Variation are prevalent in computer vision. They are used in a variety of applications such as image denoising, compressive sensi...
213
click to vote
EJC
2011
14 years 8 months ago
2011
We provide a new proof of Brylawski’s formula for the Tutte polynomial of the tensor product of two matroids. Our proof involves extending Tutte’s formula, expressing the Tutte...
139
click to vote
COCOON
2009
Springer
15 years 11 months ago
2009
Springer
This paper explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in...