✦ LIBER ✦

The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs

✍ Scribed by Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The minimum spanning tree problem on a p

✍ Tomomi Matsui 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 301 KB

A linear-size zero—one programming model

✍ Justin C. Williams 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 532 KB

Random Planar Graphs with Bounds on the

✍ Chris Dowden 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 452 KB

There are planar graphs almost as good a

✍ Christos Levcopoulos; Andrzej Lingas 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 346 KB