A degree bound on decomposable trees

Discrete Mathematics

Volumn 306, Issue 5, 2006, Pages 469-477

  Barth, Dominique ^a   Fournier, Hervé ^a  

^a UNIVERSITY OF VERSAILLES   (France)

Author keywords

Computational complexity; Integer partition; Tree decomposition

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; GRAPH THEORY; INTEGER PROGRAMMING; POLYNOMIALS;

ARBITRARY LARGE TREES; INTEGER PARTITION; POLYNOMIAL TIME ALGORITHMS; TREE DECOMPOSITION;

TREES (MATHEMATICS);

EID: 33644880235     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2006.01.006     Document Type: Article

References (19)

1. R.H. Arpaci, D.A. Patterson, The interaction of parallel and sequential workloads on a network of workstations, UC Berkeley Technical Report CS-94-830, 1994.
2. B. Awerbuch, A. Goldberg, M. Luby, S. Plotkin, Network decomposition and locality in distributed computing, in: Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, May 1989.
3. B. Awerbuch, D. Peleg, Sparse partitions. in: Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, October 1990, pp. 503-513.
4. J.L. Balcázar, J. Díaz, and J. Gabarró Structural Complexity I 1995 Springer Berlin
5. D. Barth, O. Baudon, J. Puech, Networks sharing: a polynomial algorithm for tripodes, Internal Report No. 1164, L.R.I, Université de Paris Sud, 1998.
6. D. Barth, O. Baudon, and J. Puech Networks sharing: a polynomial algorithm for tripodes Discrete Appl. Math. 119 2002 205 216
7. C. Berge Graphes et Hypergraphes 1971 Gauthier-Villard Paris
8. S.L. Bezrukov, On k-Partitioning the n-Cube, Lecture Notes in Computer Science, vol. 1197, Springer, Berlin, 1997, pp. 44-55.
9. F. Cappello, D. Etiemble, Communication in parallel architectures and networks of workstation: from standards to new standards, Proceedings of the Parallel Computer Technologies, Lecture Notes in Computer Science, vol. 1277, Springer, Berlin, 1997, pp. 298-310.
10. P. Deliste, J. Wang, X. Zheng, Utopia: a load sharing facility for large, heterogeneous distributed computing system, Technical Report CSR1-257, University of Toronto, 1992.
11. R. Descombes, Éléments de théorie des nombres, P.U.F., 1986.
12. R. Diestel Graph Theory 2000 Springer Berlin
13. R.G. Downey, and M.R. Fellows Parameterized Complexity, Monographs in Computer Science 1999 Springer Berlin
14. M.R. Garey, and D.S. Johnson Computers and Intractability, A Guide to the Theory of NP-Completeness 1979 Freeman and Co.
15. M. Horňák, and M. Woźniak Arbitrarily vertex decomposable trees are of maximum degree at most six Opuscula Math. 23 2003 49 62
16. K. Hwang Advanced Computer Architecture 1993 McGraw-Hill Int. New York
17. L. Lovas̀z M. Plummer. Matchings Theory 1987 North-Holland Amsterdam
18. M. Robson Private communication 1998 Université Bordeaux I
19. J. de Rumeur Communications dans les réseaux d'interconnexion 1994 Masson Paris