| Alternate document: Details 3-Coloring in time O(1.3446^n): a no-MIS algorithm (95) Richard Beigel, David Eppstein |
Richard Beigel, David Eppstein  Home/Search
Context
Related
| lehigh.edu/~beigel...3colorfocs.PS.gz uic.edu/~beigel/pa...3colorfocs.PS.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lehigh.edu/~beigel/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider worst case time bounds for NPcomplete problems including 3-coloring, 3-edgecoloring, and 3-list-coloring. Our algorithms are based on a common generalization of these problems, called symbol-system satisfiability or, briefly, SSS [2]. 3-SAT is equivalent to (2,3)-SSS while the other problems above are special cases of (3,2)-SSS; there is also a natural duality transformation from (a; b)-SSS to (b; a)-SSS. We give a fast algorithm for (3,2)-SSS and use it to improve the time bounds... (Update)
Active bibliography (related documents): More All
1.1: 3-Coloring in time O(1.3446^n): a no-MIS algorithm - Beigel, Eppstein (1995) (Correct)
0.6: Worst-case Analysis, 3-SAT Decision and Lower Bounds: Approaches .. - Kullmann (Correct)
0.5: A note on a generalization of Extended Resolution - Kullmann (1996) (Correct)
Similar documents based on text: More All
1.2: . SSS Socket API Remote Procedure Set (RPS) - Editor's Note Dummy (Correct)
0.5: SSS* = alpha-beta + TT - Plaat, Schaeffer, Pijls, de Bruin (1994) (Correct)
0.5: A Minimax Algorithm Better than Alpha-Beta? No and Yes - Plaat, Schaeffer, Pijls, de .. (1995) (Correct)
BibTeX entry: (Update)
@inproceedings{ beigel95coloring,
author = "Richard Beigel and David Eppstein",
title = "3-Coloring in time ${O}(1.3446^{\textstyle n})$: a no-{MIS} algorithm",
booktitle = "36th {IEEE} Symposium on Foundations of Computer Science",
pages = "444--452",
year = "1995",
url = "citeseer.ist.psu.edu/beigel95coloring.html" }
Citations (may not include all citations):153 Graph Coloring Problems (context) - Jensen, Toft - 1995
72 On generating all maximal independent sets (context) - Johnson, Yannakakis et al. - 1988
49 Algorithms for maximum independent sets (context) - Robson - 1986
47 Solving satisfiability in less than 2 n steps (context) - Monien, Speckenmeyer - 1985
28 Finding a maximum independent set (context) - Tarjan, Trojanowski - 1977
17 On cliques in graphs (context) - Moon, Moser - 1965
13 Solving 3-satisfiability in less than 1:579 n steps (context) - Schiermeyer - 1993
13 Obere Komplexitatsschranken fur TAUT-Entscheidungen (context) - Luckhardt - 1984
10 The Language of Machines: An Introduction to Computability a.. (context) - Floyd, Beigel - 1993
9 A systematical approach to 3-SAT-decision (context) - Kullmann - 1995
8 algorithm for solving maximum independent set problem (context) - Jian - 1986
7 A note on the complexity of the chromatic number problem (context) - Lawler - 1976
4 A simple algorithm for finding a maximum clique and its wors.. (context) - Shindo, Tomita - 1990
3 Deciding 3-colourability in less than O (context) - Schiermeyer - 1994
3 Various upper bounds on the complexity of algorithms for dec.. (context) - Kullmann, Luckhardt - 1994
Documents on the same site (http://www.eecs.lehigh.edu/~beigel/papers/): More
Downward Separation Fails Catastrophically for Limited.. - Beigel, Goldsmith (1994) (Correct)
Counting Classes: Thresholds, Parity, Mods, and Fewness - Richard Beigel, John Gill (1996) (Correct)
Fault Diagnosis in a Flash - Beigel, Hurwood, Kahale (1994) (Correct)
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