✦ LIBER ✦

Edge-disjoint minimum-weight connected spanning k-edge subgraphs in a weighted graph: A connectedness theorem

✍ Scribed by Xueliang Li

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The connectivity of the SEE-graph and AE

✍ Xueliang Li 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 447 KB

An approximation algorithm for finding a

✍ A. E. Baburin; E. Kh. Gimadi 📂 Article 📅 2008 🏛 Pleiades Publishing 🌐 English ⚖ 713 KB

A proof of unimodality on the numbers of

✍ Peng Cheng; Shigeru Masuyama 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 721 KB