✦ LIBER ✦

Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs

✍ Scribed by Jørgen Bang-Jensen; Daniel Gonçalves; Inge Li Gørtz

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pairs of edge disjoint Hamiltonian circu

✍ Moshe Rosenfeld 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 371 KB

Pairs of edge disjoint Hamiltonian circu

✍ M. Rosenfeld 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 21 KB

Recognition algorithm for intersection g

✍ B.S. Panda; S.P. Mohanty 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 513 KB

Finding the most vital edge with respect

✍ Lih-Hsing Hsu; Rong-Hong Jan; Yu-Che Lee; Chun-Nan Hung; Maw-Sheng Chern 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 557 KB

An optimal algorithm to find the degrees

✍ Saibal Banerjee 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 243 KB

Asymptotically optimal algorithm for fin

✍ E. Kh. Gimadi 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 457 KB