DSDP-STABLE(1)

💖 DSDP-STABLE(1) 💖

okay bestie, pull up a chair, because this is the manual page for dsdp-stable — a whole little program that lives in the DSDP family (version 5.8, if we're being precise, and we ARE) 🫶

---

✨ NAME ✨

dsdp-stable — find the maximum stable set of a graph 🎀

---

✨ SYNOPSIS ✨

dsdp-stable [OPTIONS] GRAPH_FILE

---

✨ DESCRIPTION ✨

so the way this works is: dsdp-stable reads a graph in from a file, formulates the Maximum Stable Set problem out of it, and then solves that problem using the DSDP library. that's it. that's the whole vibe. iconic behavior honestly 💅

---

✨ OPTIONS ✨

• -dloginfo N — sets the logging level, and the default is 0. the higher you push that number, the more info it prints at you. so if you're nosy (same), crank it up 🌸
• -params FILE — reads DSDP parameters from FILE 📂
• -help — prints a help message. bestie behavior. it's giving "just ask" 💖

---

✨ FILE FORMAT ✨

your input file needs to look like this, exactly this shape:

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: r is the row, c is the column, and w is the weight. and here's the tea: the weight is ignored if it's present. so include it, don't include it, the program is unbothered fr fr 🙈

---

✨ SEE ALSO ✨

• dsdp-color(1)
• dsdp5(1)
• dsdp-maxcut(1)
• dsdp-theta(1)

---

and that's the page!! 💜 this little love letter comes to you from DSDP 5.8, dated with DSDP-STABLE(1) energy — go forth and find those maximum stable sets, you absolute main character 👑✨