96 search results - page 10 / 20 » New Plain-Exponential Time Classes for Graph Homomorphism |
ECCV
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
COCOA
2008
Springer
13 years 10 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
CATS
2006
13 years 10 months ago
2006
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...