458 search results - page 8 / 92 » Totally magic graphs |
115
click to vote
SCALESPACE
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In this paper, we suggest an algorithm to recover an image whose wavelet coefficients are partially lost. We propose a wavelet inpainting model by using L0-norm and the t...
134
Voted
DAM
2000
15 years 1 months ago
2000
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
112
click to vote
ILP
2003
Springer
15 years 7 months ago
2003
Springer
In this paper, we investigate condensation of a clause. First, we extend a substitution graph introduced by Scheffer et al. (1996) to a total matcher graph. Then, we give a correc...
105
click to vote
DM
2010
15 years 1 months ago
2010
We introduce the concept of an edge-colouring total k-labelling. This is a labelling of the vertices and the edges of a graph G with labels 1, 2, . . . , k such that the weights o...
112
Voted
WWW
2005
ACM
16 years 2 months ago
2005
ACM
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...