✦ LIBER ✦

Total unimodularity and the Euler-subgraph problem

✍ Scribed by Manfred Padberg

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Total unimodularity and the transportati

✍ Kenneth R. Rebman 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 641 KB

A branch and bound algorithm for the acy

✍ R. Kaas 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 612 KB

A branch-and-cut algorithm for the k-edg

✍ F. Bendali; I. Diarrassouba; A.R. Mahjoub; M. Didi Biha; J. Mailfert 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 301 KB 👁 1 views

A fast and simple algorithm for the bott

✍ Abraham P. Punnen; K.P.K. Nair 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 323 KB

An efficiently solvable case of the mini

✍ M. B. Richey; R. Gary Parker; R. L. Rardin 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB

Edge-maximal triangulated subgraphs and

✍ Jue Xue 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 855 KB