227 search results - page 7 / 46 » Weighted Coloring: Further Complexity and Approximability Re... |
IWPEC
2010
Springer
13 years 5 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
ICPR
2010
IEEE
14 years 25 days ago
2010
IEEE
—Captions in videos play a significant role for automatically understanding and indexing video content, since much semantic information is associated with them. This paper presen...
CGF
2011
12 years 11 months ago
2011
Bidirectional texture functions (BTFs) represent the appearance of complex materials. Three major shortcomings with BTFs are the bulky storage, the difficulty in editing and the ...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...