{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:40Z","timestamp":1725664420698},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584308"},{"type":"electronic","value":"9783540487890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58430-7_31","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:03:50Z","timestamp":1330272230000},"page":"349-358","source":"Crossref","is-referenced-by-count":0,"title":["Parallel recognition and location algorithms for chordal graphs using distance matrices"],"prefix":"10.1007","author":[{"given":"Stavros D.","family":"Nikolopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/65950.65958","volume":"36","author":"P Beame","year":"1989","unstructured":"Beame, P, Hastad, J.: Optimal Bounds for Decision Problems on the CRCW PRAM. J. Assoc. Comput. Mach. 36 (1989) 643\u2013670.","journal-title":"J. Assoc. Comput. Mach."},{"key":"31_CR2","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C. Beeri","year":"1983","unstructured":"Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the Desirability of Acyclic Database Schemes, J. Assoc. Comput. Mach. 30 (1983) 479\u2013513.","journal-title":"J. Assoc. Comput. Mach."},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Coppersmith, A., Winogrand, S.: Matrix Multiplication via Arithmetic Prograssion, in STO87, 1\u20136, 1987.","DOI":"10.1145\/28395.28396"},{"key":"31_CR4","unstructured":"Dahlhaus, E., Karpinski, M.: Fast Parallel Computation of Perfect and Strongly Perfect Elimination Schemes, Res. Rept. RJ 5901 (59206), IBM Research Division, 1987."},{"key":"31_CR5","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0020-0190(87)90140-2","volume":"24","author":"A. Edenbrandt","year":"1987","unstructured":"Edenbrandt, A. Chordal Graph Recognition is in NC, Inform. Process. Lett. 24 (1987) 239\u2013241.","journal-title":"Inform. Process. Lett."},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Fich, F.E., Ragde, P.L., Wigderson, A.: Relations Between Concurrent-Write Models of Parallel Computation, Proc. 3rd Annual ACM Symposium on Principles of Distributed Computing, 179\u2013189, 1984.","DOI":"10.1145\/800222.806745"},{"key":"31_CR7","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D.R. Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.A.: Incidence Matrices and Interval Graphs, Pacific J. Math. 15 (1965) 835\u2013855.","journal-title":"Pacific J. Math."},{"key":"31_CR8","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, Academic Press, Inc., New York, 1980."},{"key":"31_CR9","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0020-0190(88)90178-0","volume":"28","author":"C-W. Ho","year":"1988","unstructured":"Ho, C-W., Lee, R.C.T.: Efficient Parallel Algorithms for Maximal Cliques, Clique Tree, and Minimum Colouring on Chordal Graphs, Inform. Process. Lett. 28 (1988) 301\u2013309.","journal-title":"Inform. Process. Lett."},{"key":"31_CR10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0020-0190(89)90070-7","volume":"31","author":"C-W. Ho","year":"1989","unstructured":"Ho, C-W., Lee, R.C.T.: Counting Clique Trees and Computing Perfect Elimination Schemes in Parallel, Inform. Process. Lett. 31 (1989) 61\u201368.","journal-title":"Inform. Process. Lett."},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Klein, P.N.: Efficient Parallel Algorithms for Chordal Graphs, 4th SIAM Conference on Discrete Mathematics, San Francisco, CA, 1988.","DOI":"10.1109\/SFCS.1988.21933"},{"key":"31_CR12","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0020-0190(82)90093-X","volume":"14","author":"L. Kucera","year":"1982","unstructured":"Kucera, L.: Parallel Computation and Conflicts in Memory Access, Inform. Process. Lett. 14 (1982) 93\u201396.","journal-title":"Inform. Process. Lett."},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Naor, J., Naor, M., Schaffer, A.: Fast Parallel Algorithms for Chordal graphs, Proc. 19th ACM Symp. on Theory of Computing, 355\u2013364, 1987.","DOI":"10.1145\/28395.28433"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Nikolopoulos, S.D., Danielopoulos, S.D.: Parallel Computation of Perfect Elimination Schemes using Partition Techniques on Triangulated Graphs, Computers and Mathematics with Applications (to appear).","DOI":"10.1016\/0898-1221(95)00006-K"},{"key":"31_CR15","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R.E. Tarjan","year":"1984","unstructured":"Tarjan, R.E., Yannakakis, M.: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs, SIAM J. Computing 13 (1984) 566\u2013579.","journal-title":"SIAM J. Computing"},{"key":"31_CR16","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0196-6774(83)90033-0","volume":"4","author":"U. Vishkin","year":"1983","unstructured":"Vishkin, U.: Implementation of Simultaneous Memory Address Access in Model that Forbid It, J. of Algorithms 4 (1983) 45\u201350.","journal-title":"J. of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing: CONPAR 94 \u2014 VAPP VI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58430-7_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:20:46Z","timestamp":1605648046000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58430-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584308","9783540487890"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-58430-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}