scientific article; zbMATH DE number 1306877

zbMath0938.68940MaRDI QIDQ4252729

David Eppstein, Richard Beigel

Publication date: 26 April 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (15)

Vertex coloring of a graph for memory constrained scenarios ⋮ Dominating set based exact algorithms for \(3\)-coloring ⋮ New methods for 3-SAT decision and worst-case analysis ⋮ A note on the complexity of minimum dominating set ⋮ An exact algorithm for the channel assignment problem ⋮ On the complexity of \(k\)-SAT ⋮ Frozen development in graph coloring ⋮ Guided Search and a Faster Deterministic Algorithm for 3-SAT ⋮ Solving and sampling with many solutions ⋮ Molecular computing, bounded nondeterminism, and efficient recursion ⋮ DNA models and algorithms for NP-complete problems ⋮ Exact and approximative algorithms for coloring G(n,p) ⋮ The resolution complexity of random graph \(k\)-colorability ⋮ Which problems have strongly exponential complexity? ⋮ Variable and value elimination in binary constraint satisfaction via forbidden patterns

This page was built for publication: