1629 search results - page 28 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
ICPP
2002
IEEE
15 years 2 months ago
2002
IEEE
Power aware computing has become popular recently and many techniques have been proposed to manage the energy consumption for traditional real-time applications. We have previousl...
FSTTCS
2008
Springer
14 years 10 months ago
2008
Springer
We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL [TW08]. In this paper, we give a determin...
ICCD
2001
IEEE
15 years 6 months ago
2001
IEEE
Dynamic power is the main source of power consumption in CMOS circuits. It depends on the square of the supply voltage. It may significantly be reduced by scaling down the supply ...
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
100
click to vote
IPSN
2010
Springer
14 years 11 months ago
2010
Springer
The IEEE 802.15.4 standard for wireless sensor networks can support energy efficient, reliable, and timely packet transmission by tuning the medium access control parameters macMi...