✦ LIBER ✦

Finding vertex-surjective graph homomorphisms

✍ Scribed by Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing vertex-surjective homomorphism

✍ Golovach, Petr A.; Paulusma, Daniël; Song, Jian 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 462 KB

Finding the Vertex Connectivity of Graph

✍ Galil, Zvi 📂 Article 📅 1980 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 415 KB

Finding all minimum-size separating vert

✍ Arkady Kanevsky 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 812 KB

An algorithm for finding simultaneous ho

✍ Gregory H. Heil; Harrison C. White 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 685 KB

On finding a minimum vertex cover of a s

✍ Ioannis G. Tollis 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 457 KB

Improved algorithms for finding length-b

✍ Chih-Chiang Yu; Chien-Hsin Lin; Biing-Feng Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 323 KB