762 search results - page 116 / 153 » Strategic Coloring of a Graph |
BMVC
2010
14 years 4 months ago
2010
Saliency detection is a well researched problem in computer vision. In previous work, most of the effort is spent on manually devising a saliency measure. Instead we propose a sim...
66
Voted
JCT
2008
14 years 9 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
CCS
2009
ACM
15 years 10 months ago
2009
ACM
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
DAM
2010
14 years 9 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
ICALP
2009
Springer
15 years 9 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...