828 search results - page 55 / 166 » Simplicial Powers of Graphs |
ESA
2007
Springer
14 years 2 months ago
2007
Springer
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
ISAAC
2004
Springer
14 years 2 months ago
2004
Springer
The k-Leaf Root problem is a particular case of graph power problems. Here, we study “error correction” versions of k-Leaf Root—that is, for instance, adding or deleting at m...
MVA
2007
13 years 10 months ago
2007
In the last few years, computer vision and image processing techniques have been developed to solve many problems. One of them, graph cut method is powerful optimization technique...
WWW
2003
ACM
14 years 9 months ago
2003
ACM
We present a novel algorithm for the fast computation of PageRank, a hyperlink-based estimate of the "importance" of Web pages. The original PageRank algorithm uses the ...
VLDB
2007
ACM
14 years 9 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...