1629 search results - page 157 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
108
click to vote
SWAT
2010
Springer
15 years 3 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...
CORR
2011
Springer
14 years 5 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...
DAC
2006
ACM
15 years 11 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...
110
click to vote
CCS
2007
ACM
15 years 2 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...
ATAL
2006
Springer
15 years 2 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...