Partitioning of trees for minimizing height and cardinality

Information Processing Letters

Volumn 89, Issue 4, 2004, Pages 181-185

  Kovács, András ^a,b   Kis, Tamás ^b  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

^b INSTITUTE FOR COMPUTER SCIENCE AND CONTROL   (Hungary)

Author keywords

Analysis of algorithms; Computational complexity; Graph algorithms; Partitioning of trees

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GRAPH THEORY; POLYNOMIALS; TREES (MATHEMATICS);

GRAPH ALGORITHMS; PARTITIONING OF TREES;

PROBLEM SOLVING;

EID: 0347600419     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2003.11.004     Document Type: Article

References (5)

1. Becker R.I., Perl Y. The shifting algorithm technique for the partitioning of trees. Discrete Appl. Math. 62:1995;15-34.
2. Hamacher A., Hochstättler W., Moll C. Tree partitioning under constraints - clustering for vehicle routing problems. Discrete Appl. Math. 99:2000;55-69.
3. Johnson D.S., Niemi K.A. On knapsacks, partitions, and a new dynamic programming technique for trees. Math. Oper. Res. 8:(1):1983;1-14.
4. Kundu S., Misra J. A linear tree partitioning algorithm. SIAM J. Comput. 6:1977;151-154.
5. Maravalle M., Simeone B., Naldini R. Clustering on trees. Comput. Statist. Data Anal. 24:1997;217-234.