E. L. Lawler, A Note on the Complexity of the chromatic number problem, Inform. Process. Lett. 5 (1976), 66-67. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Small Maximal Independent Sets and Faster Exact Graph Coloring - Eppstein (2001) (3 citations) (Correct)
....the exact chromatic number of a graph in time O( 4 3 3 4 3 4) n ) # 2.4150 n , improving a previous O( 1 3 1 3 ) n ) # 2. 4422 n algorithm of Lawler (1976) 1 Introduction One of the earliest works in the area of worst case analysis of NP hard problems is a 1976 paper by Lawler [5] on graph coloring. It contains two results: an algorithm for finding a 3 coloring of a graph (if the graph is 3 chromatic) in time O(3 n 3 ) # 1.4422 n , and an algorithm for finding the chromatic number of an arbitrary graph in time O( 1 3 1 3 ) n ) # 2.4422 n . Since then, the ....
E. L. Lawler. A note on the complexity of the chromatic number problem. Inf. Proc. Lett. 5(3):66--67, August 1976.
3-Coloring in time O(1.3446^n): a no-MIS algorithm - Beigel, Eppstein (1995) (Correct)
....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 set, test whether the complement is bipartite. The maximal independent sets can be listed with polynomial delay [4] and there are at most ....
E. L. Lawler. A note on the complexity of the chromatic number problem. Inf. Proc. Lett. 5 (1976) 66--67.
3-Coloring in time O(1.3446^n): a no-MIS algorithm - Beigel, Eppstein (1995) (Correct)
....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 SAT in time O(1:2599 m ) For three coloring, we know of two relevant references. Lawler [6] is primarily concerned with the general chromatic number, but he also gives the following very simple algorithm for 3 coloring: for each maximal independent set, test whether the complement is bipartite. The maximal independent sets can be listed with polynomial delay [5] and there are at most ....
E. Lawler. A note on the complexity of the chromatic number problem. IPL 5 (1976) 66--67.
Vertex Colouring and Forbidden Subgraphs - a Survey - Randerath, Schiermeyer (2003) (Correct)
No context found.
E. L. Lawler, A Note on the Complexity of the chromatic number problem, Inform. Process. Lett. 5 (1976), 66-67.
Small Maximal Independent Sets and Faster Exact Graph Coloring - Eppstein (2003) (3 citations) (Correct)
No context found.
E. L. Lawler. A note on the complexity of the chromatic number problem. Inf. Proc. Lett. 5(3):66--67, August 1976.
The Resolution Complexity of Random Graph k-Colorability - Beame, Culberson, al. (2003) (Correct)
No context found.
E. L. Lawler. A note on the complexity of the chromatic number problem. Information Processing Letters, pages 66--67, 1976.
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