1629 search results - page 84 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
IPPS
2008
IEEE
15 years 4 months ago
2008
IEEE
Packet classification is an important function in a router’s line-card. Although many excellent solutions have been proposed in the past, implementing high speed packet classifi...
EVOW
2008
Springer
14 years 11 months ago
2008
Springer
In this paper we examine five different strategies for limiting the local search neighborhoods in the context of vehicle routing problems. The vehicle routing problem deals with th...
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
The k-Leaf Root problem is a particular case of graph power problems. Here, we study “error correction” versions of k-Leaf Root—that is, for instance, adding or deleting at m...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
HICSS
2010
IEEE
15 years 4 months ago
2010
IEEE
Numerous recent papers have found important relationships between network structure and risks within networks. These results indicate that network structure can dramatically affec...