✦ LIBER ✦

The complexity of finding uniform emulations on fixed graphs

✍ Scribed by Hans L. Bodlaender

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of finding uniform sparse

✍ Paul Bonsma; Hajo Broersma; Viresh Patel; Artem Pyatkin 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 293 KB

The complexity of finding fixed-radius n

✍ Jon L. Bentley; Donald F. Stanat; E.Hollins Williams Jr. 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 561 KB

On the complexity of finding even pairs

✍ Rudini M. Sampaio; Cléudia L. Sales 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 271 KB

The Complexity of Finding a Second Hamil

✍ Adam Krawczyk 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 120 KB

The Complexity of Finding Paths in Graph

✍ Nickelsen, Arfst; Tantau, Till 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 289 KB

On the Complexity of Finding a Sun in a

✍ Hoàng, Chính T. 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 192 KB