{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:55Z","timestamp":1759063795207},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4034,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s0166-218x(00)00322-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T11:32:09Z","timestamp":1027596729000},"page":"205-216","source":"Crossref","is-referenced-by-count":25,"title":["Decomposable trees: a polynomial algorithm for tripodes"],"prefix":"10.1016","volume":"119","author":[{"given":"D.","family":"Barth","sequence":"first","affiliation":[]},{"given":"O.","family":"Baudon","sequence":"additional","affiliation":[]},{"given":"J.","family":"Puech","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00322-X_BIB1","unstructured":"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."},{"key":"10.1016\/S0166-218X(00)00322-X_BIB2","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, A. Goldberg, M. Luby, S. Plotkin, Network decomposition and locality in distributed computing, in Proceedings of the 30th IEEE Symposium on Foundation On Computer Science, May 1989.","DOI":"10.1109\/SFCS.1989.63504"},{"key":"10.1016\/S0166-218X(00)00322-X_BIB3","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, D. Peleg, Sparse partitions, Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, 1990, pp. 503\u2013513.","DOI":"10.1109\/FSCS.1990.89571"},{"key":"10.1016\/S0166-218X(00)00322-X_BIB4","unstructured":"D. Barth, O. Baudon, J. Puech, Networks sharing: a polynomial algorithm for tripodes, internal report no. 1164, L.R.I, Universit\u00e9 de Paris-Sud, 1998."},{"key":"10.1016\/S0166-218X(00)00322-X_BIB5","series-title":"Graphes et Hypergraphes","author":"Berge","year":"1971"},{"key":"10.1016\/S0166-218X(00)00322-X_BIB6","unstructured":"S.L. Bezrukov, On k-partitioning the n-cube, Lecture Notes in Computer Science, Vol. 1197, Springer Verlag, Berlin, 1997, pp. 44\u201355."},{"key":"10.1016\/S0166-218X(00)00322-X_BIB7","doi-asserted-by":"crossref","unstructured":"F. Cappello, D. Etiemble, Communication in parallel architectures and networks of workstation: from standards to new standards, Proceedings of Parallel Computer Technologies, Lecture Notes in Computer Science 1277, Springer, Berlin, 1997, pp. 298\u2013310.","DOI":"10.1007\/3-540-63371-5_30"},{"key":"10.1016\/S0166-218X(00)00322-X_BIB8","unstructured":"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."},{"key":"10.1016\/S0166-218X(00)00322-X_BIB9","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability, a Guide to the Theory of NP-completeness, Freeman and Co., New York, 1979."},{"key":"10.1016\/S0166-218X(00)00322-X_BIB10","unstructured":"K. Hwang, Advanced Computer Architecture, McGraw-Hill Int., New York, 1993."},{"key":"10.1016\/S0166-218X(00)00322-X_BIB11","series-title":"Matchings Theory","author":"Lovas\u0300z","year":"1987"},{"key":"10.1016\/S0166-218X(00)00322-X_BIB12","unstructured":"M. Robson, Private communication, preprint, Universit\u00e9 Bordeaux I, 1998."},{"key":"10.1016\/S0166-218X(00)00322-X_BIB13","series-title":"Communications dans les r\u00e9seaux d'interconnexion","author":"de Rumeur","year":"1994"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0000322X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0000322X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T06:42:35Z","timestamp":1578465755000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X0000322X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S0166218X0000322X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00322-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}