Enumerating Minimal Subset Feedback Vertex Sets

By Fomin Fedor   Heggernes Pinar   Kratsch Dieter   Papadopoulos Charis   Villanger Yngve  

Algorithmica, Vol. 69, Iss. 1, 2014-05 ,pp. : 216-231

Springer Publishing Company

Access to resources Recommend Favorite

On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms

By Fomin Fedor   Gaspers Serge   Pyatkin Artem   Razgon Igor  

Algorithmica, Vol. 52, Iss. 2, 2008-10 ,pp. : 293-307

Springer Publishing Company

Access to resources Recommend Favorite

Approximating Minimum-Power Degree and Connectivity Problems

By Kortsarz Guy   Mirrokni Vahab   Nutov Zeev   Tsanko Elena  

Algorithmica, Vol. 60, Iss. 4, 2011-08 ,pp. : 735-742

Springer Publishing Company

Access to resources Recommend Favorite

Approximating the number of frequent sets in dense data

By Boley Mario   Grosskreutz Henrik  

Knowledge and Information Systems, Vol. 21, Iss. 1, 2009-10 ,pp. : 65-89

Springer Publishing Company

Access to resources Recommend Favorite

Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem

By Könemann Jochen   Levin Asaf   Sinha Amitabh  

Algorithmica, Vol. 41, Iss. 2, 2004-11 ,pp. : 117-129

Springer Publishing Company

Access to resources Recommend Favorite