1629 search results - page 55 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
IPL
2008
14 years 9 months ago
2008
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
TCAD
2002
14 years 9 months ago
2002
Test scheduling is an important problem in system-on-a-chip (SOC) test automation. Efficient test schedules minimize the overall system test application time, avoid test resource c...
73
Voted
ADHOCNOW
2003
Springer
15 years 3 months ago
2003
Springer
We consider topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties. The ...
102
click to vote
CPM
2006
Springer
15 years 1 months ago
2006
Springer
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
—Multipath routing can reduce the need for route updates, balance the traffic load and increase the data transfer rate in a wireless sensor network, improving the utilization of ...