1629 search results - page 35 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
175
click to vote
DAC
2011
ACM
13 years 9 months ago
2011
ACM
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
100
click to vote
JCP
2008
14 years 9 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
IOR
2008
14 years 9 months ago
2008
Wireless sensor networks pose numerous fundamental coordination problems. For instance, in a number of application domains including homeland security, environmental monitoring an...
IS
2008
14 years 9 months ago
2008
In recent years, while search engines have become more and more powerful, several specialized search engines have been developed for different domains (e.g. library services, serv...