Safe Reduction Rules for Weighted Treewidth

Author： Eijkhof Frank   Bodlaender Hans L.   Koster M.C.A.  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.47, Iss.2, 2007-02, pp. : 139-158

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Mining weighted association rules

By Lu S.   Hu H.   Li F.  

Intelligent Data Analysis, Vol. 5, Iss. 3, 2001-01 ,pp. : 211-225

Ios Press

Access to resources Recommend Favorite

WAR: Weighted Association Rules for Item Intensities

By Wang Wei   Yang Jiong   Yu Philip  

Knowledge and Information Systems, Vol. 6, Iss. 2, 2004-03 ,pp. : 203-229

Springer Publishing Company

Access to resources Recommend Favorite

Redundant association rules reduction techniques

By Ashrafi Mafruz Zaman   Taniar David   Smith Kate  

International Journal of Business Intelligence and Data Mining, Vol. 2, Iss. 1, 2007-03 ,pp. : 29-63

Inderscience Publishers

Access to resources Recommend Favorite

Treewidth Lower Bounds with Brambles

By Bodlaender Hans   Grigoriev Alexander   Koster Arie  

Algorithmica, Vol. 51, Iss. 1, 2008-05 ,pp. : 81-98

Springer Publishing Company

Access to resources Recommend Favorite

Tree-width and the monadic quantifier hierarchy

By Makowsky J.A.   Marino J.P.  

Theoretical Computer Science, Vol. 303, Iss. 1, 2003-06 ,pp. : 157-170

Elsevier

Access to resources Recommend Favorite