{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T06:14:26Z","timestamp":1648966466945},"reference-count":12,"publisher":"Elsevier BV","issue":"15-16","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0140-3664(01)00318-8","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T14:29:16Z","timestamp":1034605756000},"page":"1568-1577","source":"Crossref","is-referenced-by-count":2,"title":["Configuration of communication networks by analysing co-operation graphs"],"prefix":"10.1016","volume":"24","author":[{"given":"Houssein","family":"Adoud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Rondeau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thierry","family":"Divoux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(01)00318-8_BIB1","series-title":"Introduction to GroupWare, Workflow, and Workgroup Computing","author":"Khoshafian","year":"1995"},{"issue":"4","key":"10.1016\/S0140-3664(01)00318-8_BIB2","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/S0140-3664(98)00158-3","article-title":"Enterprise network planning and design: methodology and application","volume":"22","author":"Drakopoulos","year":"1999","journal-title":"Comput. Commun."},{"key":"10.1016\/S0140-3664(01)00318-8_BIB3","series-title":"Concurrent Engineering Fundamentals (Integrated Product Development)","first-page":"208","volume":"vol. II","author":"Prasad","year":"1997"},{"issue":"9","key":"10.1016\/S0140-3664(01)00318-8_BIB4","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1016\/0140-3664(93)90025-N","article-title":"Membership, services and protocols for cooperative framework of processes","volume":"16","author":"Diaz","year":"1993","journal-title":"Comput. Commun."},{"issue":"Octobre","key":"10.1016\/S0140-3664(01)00318-8_BIB5","first-page":"357","article-title":"Sp\u00e9cification et r\u00e9alisation formelles de syst\u00e9mes coop\u00e9ratifs, Ing\u00e9nierie des protocoles","author":"Diaz","year":"1996","journal-title":"CFIP 96"},{"issue":"4","key":"10.1016\/S0140-3664(01)00318-8_BIB6","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1080\/09544829108901686","article-title":"Model-based approaches to managing concurrent engineering","volume":"2","author":"Eppinger","year":"1991","journal-title":"J. Engng Des."},{"key":"10.1016\/S0140-3664(01)00318-8_BIB7","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/S0140-3664(01)00318-8_BIB8","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/BF01386304","article-title":"A graph theoretic approach to matrix inversion by partitioning","volume":"4","author":"Harary","year":"1962","journal-title":"Numerische Mathematik"},{"key":"10.1016\/S0140-3664(01)00318-8_BIB9","series-title":"An Introduction to the Directed Graphs Theory","author":"Harary","year":"1965"},{"key":"10.1016\/S0140-3664(01)00318-8_BIB11","doi-asserted-by":"crossref","unstructured":"B. Hendrikson, R. Leland, An improved spectral graph partitioning algorithm for mapping parallel computations, Technical report SAND\u201892 \u2014 1460, Sandia National laboratories, 1992.","DOI":"10.2172\/6970738"},{"issue":"2","key":"10.1016\/S0140-3664(01)00318-8_BIB12","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning graphs","volume":"49","author":"Kernighan","year":"1970","journal-title":"Bell Sys. Tech. J."},{"key":"10.1016\/S0140-3664(01)00318-8_BIB13","unstructured":"T.N. Bui, C. Jones, A heuristic for reducing fill sparse matrix factorization, Sixth SIAM Conference on Parallel Processing for Scientific Computing, 1993, pp. 445\u2013452."}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366401003188?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366401003188?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,12]],"date-time":"2020-01-12T04:00:22Z","timestamp":1578801622000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366401003188"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":12,"journal-issue":{"issue":"15-16","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0140366401003188"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(01)00318-8","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}