334 search results - page 4 / 67 » Improved Algorithms and Complexity Results for Power Dominat... |
ISAAC
2004
Springer
14 years 21 days ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
ICFP
2001
ACM
14 years 7 months ago
2001
ACM
Contification is a compiler optimization that turns a function that always returns to the same place into a continuation. Compilers for functional languages use contification to e...
COCOA
2009
Springer
13 years 11 months ago
2009
Springer
Online social network has developed significantly in recent years as a medium of communicating, sharing and disseminating information and spreading influence. Most of current resea...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
LCC
1994
13 years 11 months ago
1994
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...