✦ LIBER ✦

A note on the parameterized complexity of unordered maximum tree orientation

✍ Scribed by Sebastian Böcker; Peter Damaschke

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parameterized Complexity of the Spanning

✍ Bodlaender, Hans L.; Fomin, Fedor V.; Golovach, Petr A.; Otachi, Yota; Leeuwen, 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 893 KB

A note on parallel complexity of maximum

✍ Anders Dessmark; Oscar Garrido; Andrzej Lingas 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 306 KB

We present a randomized NC solution to the problem of constructing a maximum (cardinality) f-matching. constraints. @ 1998 Elsevier Science B.V.

On the complexity of labeled oriented tr

✍ Stephan Rosebrock 📂 Article 📅 2010 🏛 Indian Academy of Sciences 🌐 English ⚖ 141 KB

A note on the number of N-bit strings wi

✍ G.J. Chaitin 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 187 KB

A short note on the approximability of t

✍ G. Galbiati; F. Maffioli; A. Morzenti 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 354 KB

A Note on a Parameterization of the Sea

✍ V.K. Makin 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 235 KB