{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,27]],"date-time":"2024-07-27T17:53:11Z","timestamp":1722102791336},"reference-count":26,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":5311,"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":[[1999,1]]},"DOI":"10.1016\/s0166-218x(98)00094-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:35:45Z","timestamp":1027604145000},"page":"1-23","source":"Crossref","is-referenced-by-count":6,"title":["Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms"],"prefix":"10.1016","volume":"91","author":[{"given":"Nesrine","family":"Abbas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lorna","family":"Stewart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00094-8_BIB1","article-title":"Graph clustering: complexity, sequential and parallel algorithms","author":"Abbas","year":"1995"},{"key":"10.1016\/S0166-218X(98)00094-8_BIB2","first-page":"7","article-title":"Partitioning vertices of chordal graphs","volume":"93","author":"Abbas","year":"1993"},{"key":"10.1016\/S0166-218X(98)00094-8_BIB3","series-title":"The Design and Analysis of Parallel Algorithms","author":"Akl","year":"1989"},{"key":"10.1016\/S0166-218X(98)00094-8_BIB4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0166-218X(87)90068-0","article-title":"Some parallel algorithms on interval graphs","volume":"16","author":"Bertossi","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(98)00094-8_BIB5","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. Systems Sci."},{"issue":"1","key":"10.1016\/S0166-218X(98)00094-8_BIB6","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0743-7315(84)90004-2","article-title":"A parallel matching algorithm for convex bipartite graphs and applications to scheduling","author":"Dekel","year":"1984","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0166-218X(98)00094-8_BIB7","series-title":"Proc. WG'95","first-page":"344","article-title":"Diametral path graphs","volume":"vol. 1017","author":"Deogun","year":"1995"},{"key":"10.1016\/S0166-218X(98)00094-8_BIB8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0020-0190(97)81663-8","article-title":"An approximation algorithm for clustering graphs with dominating diametral path","volume":"61","author":"Deogun","year":"1997","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(98)00094-8_BIB9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","article-title":"Characterization of strongly chordal graphs","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(98)00094-8_BIB10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","article-title":"Domination, independent domination, and duality in strongly chordal graphs","volume":"7","author":"Farber","year":"1984","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/S0166-218X(98)00094-8_BIB11","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF00978378","article-title":"Partitioning trees: Matching, domination, and maximum diameter","volume":"10","author":"Farley","year":"1981","journal-title":"Int. J. Comput. Inform. Sci."},{"key":"10.1016\/S0166-218X(98)00094-8_BIB12","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(98)00094-8_BIB13","series-title":"Efficient Parallel Algorithms","author":"Gibbons","year":"1988"},{"key":"10.1016\/S0166-218X(98)00094-8_BIB14","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/nav.3800140304","article-title":"Maximum matching in a convex bipartite graph","volume":"14","author":"Glover","year":"1967","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/S0166-218X(98)00094-8_BIB15","series-title":"Algorithmic graph theory and perfect graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0166-218X(98)00094-8_BIB16","first-page":"325","article-title":"Polynomial algorithms for perfect graphs","volume":"21","author":"Gr\u00f6tschel","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(98)00094-8_BIB17","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1002\/net.3230120410","article-title":"Efficient algorithms for interval graphs and circular-arc graphs","volume":"12","author":"Gupta","year":"1982","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)00094-8_BIB18","series-title":"Proc. 29th Annual IEEE Symp. Foundations of Computer Science","first-page":"150","article-title":"Efficient parallel algorithms for chordal graphs","author":"Klein","year":"1988"},{"key":"10.1016\/S0166-218X(98)00094-8_BIB19","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/BF01303516","article-title":"Low diameter graph decomposition","volume":"13","author":"Linial","year":"1993","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(98)00094-8_BIB20","article-title":"Parallel algorithms for maximum matching and other problems on interval graphs","author":"Moitra","year":"1988"},{"issue":"3","key":"10.1016\/S0166-218X(98)00094-8_BIB21","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1109\/71.139209","article-title":"Optimal parallel algorithms for problems modeled by a family of intervals","volume":"3","author":"Olariu","year":"1992","journal-title":"IEEE Trans. Parallel Distributed Systems"},{"key":"10.1016\/S0166-218X(98)00094-8_BIB22","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1002\/net.3230130305","article-title":"Circuit partitioning with size and connection constraints","volume":"13","author":"Perl","year":"1983","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)00094-8_BIB23","first-page":"307","article-title":"A note on stable sets and colorings of graphs","volume":"15","author":"Poljak","year":"1974","journal-title":"Comment. Math. Univ. Carolinae"},{"key":"10.1016\/S0166-218X(98)00094-8_BIB24","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","article-title":"Bipartite permutation graphs","volume":"18","author":"Spinrad","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(98)00094-8_BIB25","series-title":"Introduction to Graph Theory","author":"West","year":"1996"},{"issue":"11","key":"10.1016\/S0166-218X(98)00094-8_BIB26","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.1109\/34.244673","article-title":"An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation","volume":"15","author":"Wu","year":"1993","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000948?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000948?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:53:06Z","timestamp":1556117586000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98000948"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":26,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0166218X98000948"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00094-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}