✦ LIBER ✦

Backtrack: An O(1) expected time algorithm for the graph coloring problem

✍ Scribed by Herbert S. Wilf

Book ID: 113162644
Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 204 KB
Volume: 18
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(84)90013-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An -time algorithm for the paired domina

An -time algorithm for the paired domination problem on permutation graphs

✍ Evaggelos Lappas; Stavros D. Nikolopoulos; Leonidas Palios 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 334 KB

A new polynomial-time algorithm for the

A new polynomial-time algorithm for the maximum weighted (χ(G) — 1)-coloring problem in comparability graphs

✍ A. Hertz 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 363 KB

An algorithm to solve the m × n assignme

An algorithm to solve the m × n assignment problem in expected time O(mn log n)

✍ Richard M. Karp 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 428 KB

## Abstract We give an algorithm to solve the __m__‐source, __n__‐destination assignment problem in expected time __O(mn__ log __n__) under the assumption that the edge costs are independent random variables and the costs of the edges incident with any given source are identically distributed. The

An expectation-maximization algorithm fo

An expectation-maximization algorithm for space-time sparsity regularization of the MEG inverse problem

✍ Andrew K. Bolstad; Barry D. Van Veen; Robert D. Nowak; Ronald T. Wakai 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 135 KB

An O(nlogn) randomizing algorithm for th

An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem

✍ Nimrod Megiddo; Eitan Zemel 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 710 KB

An O(pn2) algorithm for the p-median and

An O(pn2) algorithm for the p-median and related problems on tree graphs

✍ Arie Tamir 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 402 KB