✦ LIBER ✦

On the -edge-incident subgraph problem and its variants

✍ Scribed by Liang, Hongyu

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The k-edge connected subgraph problem I:

✍ M. Didi Biha; A.R. Mahjoub 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 279 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

Edge-maximal triangulated subgraphs and

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

The weighted perfect domination problem

✍ Yen Chain-Chin; R.C.T. Lee 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 867 KB

The three dimensional bottleneck assignm

✍ Malhotra, Rita; Bhatia, H.L.; Puri, M.C. 📂 Article 📅 1985 🏛 Taylor and Francis Group 🌐 English ⚖ 472 KB

On the 2-Chain Subgraph Cover and Relate

✍ T.H. Ma; J.P. Spinrad 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 752 KB