Partitioning a Weighted Tree into Subtrees with Weights in a Given Range

Author： Ito Takehiro   Nishizeki Takao   Schröder Michael   Uno Takeaki   Zhou Xiao  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.62, Iss.3-4, 2012-04, pp. : 823-841

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

A Learning Algorithm for Level Sets Weights in Weighted Level-based Averaging Method

By Nasibov Efendi   Baskan Onur   Mert Ali  

Fuzzy Optimization and Decision Making, Vol. 4, Iss. 4, 2005-10 ,pp. : 279-291

Springer Publishing Company

Access to resources Recommend Favorite

Tree-based partitioning of date for association rule mining

By Ahmed Shakil   Coenen Frans   Leng Paul  

Knowledge and Information Systems, Vol. 10, Iss. 3, 2006-10 ,pp. : 315-331

Springer Publishing Company

Access to resources Recommend Favorite

An exact algorithm for the node weighted Steiner tree problem

By Cordone Roberto  

4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol. 4, Iss. 2, 2006-06 ,pp. : 124-144

Springer Publishing Company

Access to resources Recommend Favorite

Enhancements of partitioning techniques for image compression using weighted finite automata

By Katritzke F.   Merzenich W.   Thomas M.  

Theoretical Computer Science, Vol. 313, Iss. 1, 2004-02 ,pp. : 133-144

Elsevier

Access to resources Recommend Favorite

Finding and Counting Vertex-Colored Subtrees

By Guillemot Sylvain  

Algorithmica, Vol. 65, Iss. 4, 2013-04 ,pp. : 828-844

Springer Publishing Company

Access to resources Recommend Favorite