Publication:4252729
From MaRDI portal
zbMath0938.68940MaRDI QIDQ4252729
David Eppstein, Richard Beigel
Publication date: 26 April 2000
Related Items
Exact and approximative algorithms for coloring G(n,p), Guided Search and a Faster Deterministic Algorithm for 3-SAT, On the complexity of \(k\)-SAT, Frozen development in graph coloring, DNA models and algorithms for NP-complete problems, Which problems have strongly exponential complexity?, An exact algorithm for the channel assignment problem, New methods for 3-SAT decision and worst-case analysis, A note on the complexity of minimum dominating set, The resolution complexity of random graph \(k\)-colorability