✦ LIBER ✦

Optimal path cover problem on block graphs and bipartite permutation graphs

✍ Scribed by R. Srikant; Ravi Sundaram; Karan Sher Singh; C. Pandu Rangan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving the shortest-paths problem on bi

✍ Lin Chen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 498 KB

Edge domination on bipartite permutation

✍ Anand Srinivasan; K. Madhukar; P. Nagavamsi; C.Pandu Rangan; Maw-Shang Chang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 638 KB

Linear algorithm for optimal path cover

✍ Srinivasa Rao Arikati; C. Pandu Rangan 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 412 KB

Methods of local optimization for the pr

✍ N.M. Metel'skii 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 214 KB

Tree 3-spanners on interval, permutation

✍ M.S. Madanlal; G. Venkatesan; C.Pandu Rangan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 481 KB

On the minimum path problem in Knödel gr

✍ Hovhannes A. Harutyunyan; Calin D. Morosan 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB