✦ LIBER ✦

A good algorithm for edge-disjoint branching

✍ Scribed by Robert Endre Tarjan

Book ID: 113161752
Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 368 KB
Volume: 3
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(74)90024-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A faster algorithm for finding edge-disj

A faster algorithm for finding edge-disjoint branchings

✍ Po Tong; E.L. Lawler 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 371 KB

A faster algorithm for finding edge-disj

A faster algorithm for finding edge-disjoint branchings

✍ Po Tong; E.L. Lawler 📂 Article 📅 1983 🏛 Elsevier Science ⚖ 118 KB

A parallel algorithm for edge-coloring o

A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles

✍ Eliezer A. Albacea 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 475 KB

A genetic algorithm for the maximum edge

A genetic algorithm for the maximum edge-disjoint paths problem

✍ Hsu, Chia-Chun; Cho, Hsun-Jung 📂 Article 📅 2015 🏛 Elsevier Science 🌐 English ⚖ 394 KB

Parallel Algorithm for Shortest Pairs of

Parallel Algorithm for Shortest Pairs of Edge-Disjoint Paths

✍ S. Banerjee; R.K. Ghosh; A.P.K. Reddy 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 241 KB

method a solution for MSP can be found within the same time bound. The problem of finding all pairs of shortest paths in a directed graph with nonnegative edge weights can be solved in O(log 2 n) time using n 3 /log n processors on a CREW PRAM [7]. Therefore, SSP can be solved within the same resou

A linear-time algorithm for edge-disjoin

A linear-time algorithm for edge-disjoint paths in planar graphs

✍ Dorothea Wagner; Karsten Weihe 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 1007 KB