1629 search results - page 157 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
198
click to vote
SWAT
2010
Springer
15 years 11 months ago
2010
Springer
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
172
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract. Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements correspon...
183
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
The gain-based technology mapping paradigm has been successfully employed for finding minimum delay and minimum area mappings. However, existing gain-based technology mappers fail...
207
click to vote
CCS
2007
ACM
15 years 10 months ago
2007
ACM
Given a history of packet transmissions and an excerpt of a possible packet payload, the payload attribution problem requires the identification of sources, destinations and the t...
176
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Numerous domains ranging from distributed data acquisition to knowledge reuse need to solve the cluster ensemble problem of combining multiple clusterings into a single unified cl...