✦ LIBER ✦

An algorithm to find two distance domination parameters in a graph

✍ Scribed by Gerd H. Fricke; Michael A. Henning; Ortrud R. Oellermann; Henda C. Swart

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm to find all paths between t

✍ M. Migliore; V. Martorana; F. Sciortino 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 341 KB

An optimal algorithm for finding dominat

✍ J.Mark Keil; Doug Schaefer 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 972 KB

A linear time algorithm to compute a dom

✍ Derek G. Corneil; Stephan Olariu; Lorna Stewart 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 477 KB

An algorithm for finding a large indepen

✍ Norishige Chiba; Takao Nishizeki; Nobuji Saito 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 333 KB 👁 1 views

An algorithm for finding a short closed

✍ K. Takamizawa; T. Nishizeki; N. Saito 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 653 KB

Cyclic games and an algorithm to find mi

✍ V.A. Gurvich; A.V. Karzanov; L.G. Khachivan 📂 Article 📅 1988 🏛 Elsevier Science ⚖ 796 KB