1952 search results - page 138 / 391 » Complete partitions of graphs |
183
click to vote
SDM
2012
SIAM
13 years 7 months ago
2012
SIAM
We propose a new matrix completion algorithm— Kernelized Probabilistic Matrix Factorization (KPMF), which effectively incorporates external side information into the matrix fac...
130
click to vote
ACSD
2003
IEEE
15 years 9 months ago
2003
IEEE
Signal Transition Graphs (STGs) are one of the most popular models for the specification of asynchronous circuits. A STG can be implemented if it admits a so-called consistent an...
130
click to vote
CCCG
2008
15 years 6 months ago
2008
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
122
click to vote
JGT
2008
15 years 4 months ago
2008
Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has ...
169
click to vote
GC
2008
Springer
15 years 4 months ago
2008
Springer
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...