{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T01:12:55Z","timestamp":1648775575705},"reference-count":25,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1988]]},"DOI":"10.1051\/ita\/1988220202451","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T14:54:10Z","timestamp":1486047250000},"page":"245-265","source":"Crossref","is-referenced-by-count":2,"title":["\u00c9tude de la s\u00e9paration et de l'\u00e9limination sur une famille de graphes quotients d\u00e9duite d'une m\u00e9thode de dissections embo\u00eet\u00e9es"],"prefix":"10.1051","volume":"22","author":[{"given":"P.","family":"Charrier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Roman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. BHATT S. N. et LEIGHTON F. T., A Framework for Solving VLSI Graph Layout Problems, J. Comput. Syst. Sci., vol. 28, 1984, p. 300-343.7605490543.68052","DOI":"10.1016\/0022-0000(84)90071-0"},{"key":"R2","unstructured":"2. CHARRIER P. et ROMAN J., Algorithmique et calculs de complexit\u00e9 pour un solveur de type dissections embo\u00eet\u00e9es, Rapport interne Informatique, Universit\u00e9 de Bordeaux-I, 1986, soumis pour publication dans Numerische Mathematik.1333640663.65020"},{"key":"R3","unstructured":"3. CHARRIER P. et ROMAN J., Study of the Parallelism Inducedby a Nested Dissection Method and of its Implementation on a Message-Passing Multiprocessor Computeur, Rapport interne Informatique, Universit\u00e9 de Bordeaux-I, 1987, soumis pour publication dans S.I.A.M. Journal of Computing."},{"key":"R4","unstructured":"4. CIARLET P. G., Numerical Analysis of the Finite Element Method, S\u00e9minaire de math\u00e9matiques sup\u00e9rieures, Presses de l'Universit\u00e9 de Montr\u00e9al, 1976.4950100363.65083"},{"key":"R5","unstructured":"5. COUNILH M. C., LEPINE J. M., ROMAN J., RUBI F. et VAUQUELIN B., Description du calculateur CHEOPS, Rapport interne Informatique, Universit\u00e9 de Bordeaux-I, 1986."},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. DJIDJEV H. N., On the Problem of Partioning Planar Graphs, S.I.A.M. J. Algebraic Discrete Methods, Vol. 3, 1982, p. 229-240.6555630503.05057","DOI":"10.1137\/0603022"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. GEORGE J. A., Nested Dissection of a Regular Finite Element Mesh., S.I.A.M. J. Numer. Anal., Vol. 10, 1973, p. 345-367.3887560259.65087","DOI":"10.1137\/0710032"},{"key":"R8","unstructured":"8. GEORGE J. A. et LIU J. W. H., Computer Solution of Large Spar se Positive Def\u00efnite Systems, Englewood Cliffs, New Jersey, Prentice Hall, 1981.6467860516.65010"},{"key":"R9","unstructured":"9. GILBERT J. R., Some Nested Dissection Order is Nearly Optimal, Technical report 86-767, Department of Computer Science, Cornell University, 1986."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"10. GILBERT J. R., HUTCHINSON J. P. et TARJAN R. E., A Separator Theorem for Graphs of Bounded Genus, J. Algorithms, vol. 5, 1984, p. 391-407.7561650556.05022","DOI":"10.1016\/0196-6774(84)90019-1"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"11. GILBERT J. R., ROSE D. J. et EDENBRANDT A., A Separator Theorem for Chordal Graphs, S.I.A.M. J. Algebraic Discrete Methods, vol. 5, 1984, p. 306-313.7520370551.05049","DOI":"10.1137\/0605032"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"12. GILBERT J. R. et TARJAN R. E., The Analysis of a Nested Dissection Algorithm, Numerische Mathematik, vol. 50, 1987, p. 377-404.1331618751640645.65012","DOI":"10.1007\/BF01396660"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"13. KUNG H. T., The Structure of Parallel Algorithm, Advances in Computers, vol.19, Academic Press, New York, 1980.","DOI":"10.1016\/S0065-2458(08)60033-9"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"14. LEIGHTON F. T., A Layout Strategy for VLSI which is Provably Good, Proc. 14th Ann. A.C.M. Symp. Theory Comput., 1982, p. 85-98.","DOI":"10.1145\/800070.802180"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"15. LIPTON R. J. et TARJAN R. E., A Separator Theorem for Planar Graphs, S.I.A.M. J. on Appl. Math., vol. 36, 1979, p. 177-189.5244950432.05022","DOI":"10.1137\/0136016"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"16. LIPTON R. J. et TARJAN R. E., Applications of a Planar Separator Theorem, S.I.A.M. J. Comput., vol. 9, 1980. p. 615-6275845160456.68077","DOI":"10.1137\/0209046"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"17. LIPTON R. J., ROSE D. J. et TARJAN R. E., Generalized Nested Dissection, S.I.A.M. J. Numer. Anal., vol. 16, 1979, p. 346-358.5264960435.65021","DOI":"10.1137\/0716027"},{"key":"R18","unstructured":"18. RAYNAL M., Algorithmique du parall\u00e9lisme: le probl\u00e8me de l'exclusion mutuelle, Dunod Informatique, 1984."},{"key":"R19","unstructured":"19. RAYNAL M., Algorithmes distribu\u00e9s et protocoles, Eyrolles, Paris, 1985."},{"key":"R20","unstructured":"20. ROMAN J., Dissection embo\u00eet\u00e9e et n\u00b0-th\u00e9or\u00e8me de s\u00e9paration (l\/2 ( \u03c3 ( l), Rapport interne Analyse appliqu\u00e9e et Informatique, Universit\u00e9 de Bordeaux-I, 1984."},{"key":"R21","doi-asserted-by":"crossref","unstructured":"21. ROMAN J., Calculs de complexit\u00e9 relatifs \u00e0 une m\u00e9thode de dissection embo\u00eet\u00e9e, Numerische Mathematik, vol.47, 1985, p. 175-190.1330307996830537.65025","DOI":"10.1007\/BF01389708"},{"key":"R22","doi-asserted-by":"crossref","unstructured":"22. ROSE D. J., A Graph-Theoretic Study of the Numerical Solution of Sparse Positive Def\u00efnite Systems of Linear Equations, Graph Theory and Computing, p. 183-217, R.C. Read, Academic Press, New York, 1973.3418330266.65028","DOI":"10.1016\/B978-1-4832-3187-7.50018-0"},{"key":"R23","doi-asserted-by":"crossref","unstructured":"23. ROSE D. J., TARJAN R. E. et LUEKER G. S., Algorithmic Aspects of Vertex Elimination on Graphs, S.I.A.M. J. Comput, vol. 5, 1976, p. 266-283.4083120353.65019","DOI":"10.1137\/0205021"},{"key":"R24","doi-asserted-by":"crossref","unstructured":"24. SETTZ C. L., The Cosmic Cube, Commun. A.C.M., vol.28, n\u00b0 1, 1985, p. 22-33.","DOI":"10.1145\/2465.2467"},{"key":"R25","unstructured":"25. VARENNE G., Dessins r\u00e9cursifs de graphes, Th\u00e8se de 3e cycle, Universit\u00e9 de Paris-VII, Laboratoire Informatique Th\u00e9orique et Programmation, 1985."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1988220202451\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T05:55:13Z","timestamp":1568786113000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1988220202451"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"references-count":25,"journal-issue":{"issue":"2"},"alternative-id":["ita1988220202451"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1988220202451","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988]]}}}