DSDP-COLOR(1)

💖 DSDP-COLOR 💖

okay bestie, so dsdp-color is a User Command and it's literally the whole thing: you hand it a graph, it finds an approximate coloring for you. Let's get into it 🎀

---

✨ NAME ✨

dsdp-color — find an approximate coloring of a graph 🦋

---

🌸 SYNOPSIS 🌸

dsdp-color [OPTIONS] GRAPH_FILE

---

👑 DESCRIPTION 👑

so basically, the dsdp-color program reads a graph from a file, formulates the SDP relaxation of the k-coloring problem, solves the problem using the DSDP library, and then applies a randomized algorithm to generate an approximate solution. main character pipeline honestly 💅

a positive semidefinite relaxation of the graph k-coloring problem can be rewritten as

Find       X>=0
such that  X_ij <= 1 - 1/(k-1) for all edges (i,j).

like. that's the whole vibe check right there ✨

---

🧚 OPTIONS 🧚

• -dloginfo N — sets the logging level (default 0). the higher the number, the more information gets printed. more tea, basically 🍓
• -params FILE — read DSDP parameters from FILE
• -help — prints a help message 🫶

---

💜 FILE FORMAT 💜

the input file should be in this format:

n m
r1 c1 [w1]
…
im jm [wm]

where n is the number of nodes, and m is the number of edges. each r/c pair or r/c/w triple describes one edge, where r is the row, c is the column, and w is the weight. the weight defaults to 0.0. the weight is not used, except that a weight of 0.0 means to ignore the edge. so lowkey the weight is just there for vibes unless it's zero 🙈

---

🌈 SEE ALSO 🌈

dsdp5(1), dsdp-maxcut(1), dsdp-stable(1), dsdp-theta(1)

---

and that's a wrap, bestie 💖 this whole thing is DSDP version 5.8 (source: DSDP, page DSDP-COLOR(1)) — go solve some graphs, you've got this 👑✨