✦ LIBER ✦

A linear vertex kernel for maximum internal spanning tree

✍ Scribed by Fedor V. Fomin; Serge Gaspers; Saket Saurabh; Stéphan Thomassé

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Cubic-Vertex Kernel for Flip Consensus

✍ Christian Komusiewicz, Johannes Uhlmann 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 958 KB

A Survey on Algorithms for the Maximum I

✍ Gábor Salamon 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 224 KB

A linear algorithm for centering a spann

✍ K.S. Easwarakumar; C.Pandu Rangan; G.A. Cheston 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 381 KB

Optimal algorithms for the single and mu

✍ D. B. Johnson and P. Metaxas 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 336 KB

Optimal Algorithms for the Single and Mu

✍ Metaxas, D.B. Johnson, P. 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 192 KB

A mixed integer linear formulation for t

✍ M.Eugénia Captivo; João C.N. Clímaco; Marta M.B. Pascoal 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 114 KB