1188 search results - page 30 / 238 » Extended Graph Unification |
SDM
2012
SIAM
12 years 8 days 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...
WG
2005
Springer
14 years 3 months ago
2005
Springer
The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree-width. Th...
ICALP
2000
Springer
14 years 1 months ago
2000
Springer
We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...
CORR
1999
Springer
13 years 9 months ago
1999
Springer
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
GLOBECOM
2010
IEEE
13 years 7 months ago
2010
IEEE
In the Skip Graph, which is a structured overlay network that supports range retrievals, a key is supposed to consist of a single value. Therefore, the Skip Graph cannot perform ra...