rajesh kumar | IIT Kanpur (original) (raw)
I am a kind of person who loves to experiment with my ideas. My friends told me that I am very colorful in my nature. Even tough don’t have much time after passing out from the college to spend wit friends. But whenever I get change I like to go out to some hill station....
less
Uploads
Papers by rajesh kumar
… Journal of Robotics …, Jan 1, 1999
… Aided Design of Integrated Circuits and …, Jan 1, 2002
Maximum and minimum mean cycle problems are important problems with many applications in performa... more Maximum and minimum mean cycle problems are important problems with many applications in performance analysis of synchronous and asynchronous digital systems including rate analysis of embedded systems, in discrete-event systems, and in graph theory. Karp's algorithm is one of the fastest and commonest algorithms for both of these problems. We present this paper mainly in the context of the maximum mean cycle problem. We show that Karp's algorithm processes more vertices and arcs than needed to nd the maximum cycle mean of a digraph. This observation motivated us to propose a new graph unfolding scheme that remedies this de ciency and leads to three faster algorithms with di erent characteristics. Asymptotic analysis tells us that our algorithms always run faster than Karp's algorithm. Experiments on benchmark graphs con rm this fact for most of the graphs. Like Karp's algorithm, they are also applicable to both the maximum and minimum mean cycle problems. Moreover, one of them is among the fastest to date.
… Journal of Robotics …, Jan 1, 1999
… Aided Design of Integrated Circuits and …, Jan 1, 2002
Maximum and minimum mean cycle problems are important problems with many applications in performa... more Maximum and minimum mean cycle problems are important problems with many applications in performance analysis of synchronous and asynchronous digital systems including rate analysis of embedded systems, in discrete-event systems, and in graph theory. Karp's algorithm is one of the fastest and commonest algorithms for both of these problems. We present this paper mainly in the context of the maximum mean cycle problem. We show that Karp's algorithm processes more vertices and arcs than needed to nd the maximum cycle mean of a digraph. This observation motivated us to propose a new graph unfolding scheme that remedies this de ciency and leads to three faster algorithms with di erent characteristics. Asymptotic analysis tells us that our algorithms always run faster than Karp's algorithm. Experiments on benchmark graphs con rm this fact for most of the graphs. Like Karp's algorithm, they are also applicable to both the maximum and minimum mean cycle problems. Moreover, one of them is among the fastest to date.