✦ LIBER ✦

A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph

✍ Scribed by Panda, B.S.; Pradhan, D.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear-Time Algorithm for the Paired-Dom

✍ Ruo-Wei Hung 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 809 KB

A linear time algorithm for maximum matc

✍ G. Steiner; J.S. Yeomans 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 563 KB

A linear algorithm for finding a minimum

✍ S.T Hedetniemi; Renu Laskar; John Pfaff 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 312 KB

A -approximation algorithm for minimum w

✍ Decheng Dai; Changyuan Yu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 919 KB

Homogeneous sets and domination: A linea

✍ Falk Nicolai; Thomas Szymczak 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

A linear algorithm for bipartition of bi

✍ Hitoshi Suzuki; Naomi Takahashi; Takao Nishizeki 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 343 KB