334 search results - page 9 / 67 » Improved Algorithms and Complexity Results for Power Dominat... |
COMBINATORICA
2010
13 years 2 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
ICMCS
2010
IEEE
13 years 8 months ago
2010
IEEE
Reference Picture Selection (RPS) is a powerful error control technique for video streaming. Previously, two fast block-based motion vector concatenation (MVC) algorithms were pro...
ALENEX
2009
13 years 8 months ago
2009
In this paper we present an experimental study of several maximum flow algorithms in the context of unbalanced bipartite networks. Our experiments are motivated by a real world pr...
SODA
2012
ACM
11 years 9 months ago
2012
ACM
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...
MOBIHOC
2008
ACM
14 years 7 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...