715 search results - page 72 / 143 » On graphs with subgraphs having large independence numbers |
197
click to vote
IJCV
2006
15 years 1 months ago
2006
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
103
click to vote
JBI
2006
15 years 1 months ago
2006
Bioinformatics is a dynamic research area in which a large number of algorithms and programs have been developed rapidly and independently without much consideration so far of the...
106
click to vote
TJS
2008
15 years 1 months ago
2008
Abstract Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between ...
126
click to vote
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
—Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment an...
APPROX
2009
Springer
15 years 8 months ago
2009
Springer
Recently, Hazan and Krauthgamer showed [12] that if, for a fixed small ε, an ε-best ε-approximate Nash equilibrium can be found in polynomial time in two-player games, then it ...