T. Jian. An O(2 0:304n ) algorithm for solving maximum independent set problem. IEEE Transactions on Computers, , 35(9):847851, 1986.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....d 0. Although all NP complete problems are equivalent as far as the existence of polynomial time algorithms is concerned, there is wide variation in the worst case complexity of known algorithms for these problems. For example, there have been several algorithms for maximum independent set [7, 12, 17, 18], and the best of these takes time 1:2108 in the worst case [12] Recently, a 3 coloring algorithms with 1:3446 worst case time complexity is presented [2] and it is known that k coloring can be solved in 2:442 time [4] However, it is not known what if any relationships exist among the ....

Jian, T. (1986), An O(2 0:304n algorithm for solving maximum independent set problem, IEEE Transactions on Computers, C-35, 847-851.

....where the parameterized algorithm (or, more commonly, xed parameter algorithm ) may, in some applications, be preferable to the corresponding approximation algorithm(s) Exact algorithms for NP hard problems. The NP complete Maximum Independent Set problem was studied in a series of papers [40, 29, 36, 9], the best known general bound so far being O(1:211 n ) where n is the number 2 of vertices in the given graph. Also, special cases (e.g. bounded vertex degree) have recently been studied [9, 11] Another, even more prominent eld of investigations on upper bounds are Satis ability problems, ....

T. Jian. An o(2 0:304n ) algorithm for solving Maximum Independent Set problem. IEEE Transactions on Computers, 35(9):847-851, 1986.

....case analysis of algorithms for NP hard optimization problems, in particular for the Independent Set problem. Since the initialization by Tarjan and Trojanowski [17] with an O(2 n=3 ) time algorithm for the Independent Set problem, there have been continuous improved algorithms for the problem [11, 15, 16]. The best of these algorithms is due to Robson [15] whose algorithm solves the Independent Set problem in time O(2 0:276n ) Other ecient exponential time algorithms for NP hard optimization problems include Kullmann s O(1:5045 n ) time algorithm for the 3 Sat problem [12] and Beigel and ....

....set has been playing a major role in the study of optimization problems. Initialized by Tarjan and Trojanowski s algorithm of running time O(2 n=3 ) 17] ecient exponential time algorithms for the Maximum Independent Set problem have been investigated for more than two decades. Jian [11] re ned Tarjan and Trojanowski s algorithm and presented an algorithm of running time O(2 0:304n ) and Shindo and Tomita [16] developed more recently a simpler algorithm of running time O(2 n=2:863 ) The best algorithm for the Maximum Independent Set problem is due to Robson [15] whose ....

T. Jian, An O(2 0:304n ) algorithm for solving maximum independent set problem, IEEE Trans. Comput. 35, (1986), pp. 847-851.

....in a graph, and m denotes the number of constraints in an SSS problem (clauses in a SAT problem) 2 1.2 Related Work We have only found a small number of papers on worst case analysis of algorithms for NP hard problems. Several authors have described algorithms for maximum independent sets [2, 7, 8, 11]; the best of these is Robson s [7] which takes time O(1:2108 n ) For three coloring, we know of two relevant references. Lawler [5] is primarily concerned with the general chromatic number, but he also gives the following very simple algorithm for 3 coloring: for each maximal independent ....

T. Jian. An O(2 0:304n ) algorithm for solving maximum independent set problem. IEEE Trans. Comput. C-35 (1986) 847--851.

....case analysis of algorithms for NP hard optimization problems, in particular for the Independent Set problem. Since the initialization by Tarjan and Trojanowski [17] with an O(2 n=3 ) time algorithm for the Independent Set problem, there have been continuous improved algorithms for the problem [11, 15, 16]. The best of these algorithms is due to Robson [15] whose algorithm solves the Independent Set problem in time O(2 0:276n ) Other efficient exponential time algorithms for NP hard optimization problems include Kullmann s O(1:5045 n ) time algorithm for the 3 Sat problem [12] and Beigel ....

....set has been playing a major role in the study of optimization problems. Initialized by Tarjan and Trojanowski s algorithm of running time O(2 n=3 ) 17] efficient exponential time algorithms for the Maximum Independent Set problem have been investigated for more than two decades. Jian [11] refined Tarjan and Trojanowski s algorithm and presented an algorithm of running time O(2 0:304n ) and Shindo and Tomita [16] developed more recently a simpler algorithm of running time O(2 n=2:863 ) The best algorithm for the Maximum Independent Set problem is due to Robson [15] whose ....

T. Jian, An O(2 0:304n ) algorithm for solving maximum independent set problem, IEEE Trans. Comput. 35, (1986), pp. 847-851.

....in a graph, and m denotes the number of constraints in an SSS problem (clauses in a SAT problem) 1.2 Related Work We have found only a small number of papers on worst case analysis of algorithms for NP hard problems. Several authors have described algorithms for maximum independent sets [4, 12, 13, 16]; the best of these is Robson s [12] which takes time O(1:2108 n ) Several others have described algorithms for Boolean formula satisfiability [1, 7, 8, 9, 11, 14] the best of these are Kullmann s [9] which solves 3 SAT in time O(1:5045 n ) 9] and Monien and Speckenmeyer s, which solves ....

T. Jian. An O(2 0:304n ) algorithm for solving maximum independent set problem. IEEE Trans. Comput. C-35 (1986) 847--851.

No context found.

T. Jian. An O(2 0:304n ) algorithm for solving maximum independent set problem. IEEE Transactions on Computers, , 35(9):847851, 1986.

No context found.

Jian, T., An O(2 0:304n )-Algorithm for Solving Maximum Independent Set Problem, IEEE Transactions on Computers, vol.C-35, No. 9, (1986), pp. 847-851.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC