✦ LIBER ✦

Minimum Coloring k-Colorable Graphs in Polynomial Average Time

✍ Scribed by C.R. Subramanian

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 137 KB
Volume: 33
Category: Article
ISSN: 0196-6774
DOI: 10.1006/jagm.1999.1035

No coin nor oath required. For personal study only.

✦ Synopsis

We present algorithms for minimum G -coloring k-colorable graphs drawn from random and semi-random models. In both models, an adversary initially splits Ž . the vertices into k color classes V , . . . , V of sizes ⍀ n each. In the first model,

📜 SIMILAR VOLUMES

Average distance in colored graphs

✍ Peter Dankelmann; Wayne Goddard; Peter Slater 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

## Abstract For a graph __G__ where the vertices are colored, the __colored distance__ of __G__ is defined as the sum of the distances between all unordered pairs of vertices having different colors. Then for a fixed supply __s__ of colors, __d~s~(G)__ is defined as the minimum colored distance ove