828 search results - page 15 / 166 » Simplicial Powers of Graphs |
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
In this work, we extend a common framework for seeded
image segmentation that includes the graph cuts, ran-
dom walker, and shortest path optimization algorithms.
Viewing an ima...
DM
1998
13 years 8 months ago
1998
A basis of the cycle space C(G) of a graph G is h-fold if each edge of G occurs in at most h cycles of the basis. The basis number b(G) of G is the least integer h such that C(G) ...
JCT
2011
13 years 3 months ago
2011
The standard paradigm for online power of two choices problems in random graphs is the Achlioptas process. Here we consider the following natural generalization: Starting with G0 a...
WALCOM
2008
IEEE
13 years 10 months ago
2008
IEEE
In this paper, a fast algorithm is proposed to calculate kth power of an n