1629 search results - page 37 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
TC
2008
14 years 9 months ago
2008
Quality of service (QoS) is becoming an attractive feature for high-performance networks and parallel machines because, in those environments, there are different traffic types, ea...
SIGMOD
2011
ACM
14 years 17 days ago
2011
ACM
We consider extending decision support facilities toward large sophisticated networks, upon which multidimensional attributes are associated with network entities, thereby forming...
ESA
2004
Springer
15 years 3 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
CAGD
2000
14 years 9 months ago
2000
Evaluation routines are essential for any application that uses triangular B-spline surfaces. This paper describes an algorithm to efficiently evaluate triangular B-spline surface...
ICCD
2008
IEEE
15 years 6 months ago
2008
IEEE
—In this paper, a new FIR digital filter synthesis algorithm is proposed to consider multiple adder graphs for a coefficient. The proposed algorithm selects an adder graph that c...