425 search results - page 29 / 85 » Polynomial Time Data Reduction for Dominating Set |
TSP
2008
14 years 11 months ago
2008
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
FM
2001
Springer
15 years 3 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
109
click to vote
LCPC
1994
Springer
15 years 3 months ago
1994
Springer
Data parallel programs are sensitive to the distribution of data across processor nodes. We formulate the reduction of inter-node communication as an optimization on a colored gra...
112
click to vote
ICALP
2009
Springer
15 years 11 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...