{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T00:41:21Z","timestamp":1776127281930,"version":"3.50.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1992,5]]},"DOI":"10.1016\/0020-0190(92)90140-q","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"153-159","source":"Crossref","is-referenced-by-count":255,"title":["Finding good approximate vertex and edge partitions is NP-hard"],"prefix":"10.1016","volume":"42","author":[{"given":"Thang Nguyen","family":"Bui","sequence":"first","affiliation":[]},{"given":"Curt","family":"Jones","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90140-Q_BIB1","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF02579448","article-title":"Graph bisection algorithms with good average case behavior","volume":"7","author":"Bui","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0020-0190(92)90140-Q_BIB2","first-page":"775","article-title":"Improving the performance of the Kernighan\u2013Lin and simulated annealing graph bisection algorithms","author":"Bui","year":"1989","journal-title":"Proc. 26th Design Automation Conf."},{"key":"10.1016\/0020-0190(92)90140-Q_BIB3","first-page":"150","article-title":"Parallel algorithms for partitioning simple classes of graphs","volume":"Vol. 3","author":"Bui","year":"1990","journal-title":"Proc. 1990 Internat. Conf. on Parallel Processing"},{"key":"10.1016\/0020-0190(92)90140-Q_BIB4","doi-asserted-by":"crossref","DOI":"10.1137\/0221016","article-title":"Partitioning planar graphs","author":"Bui","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90140-Q_BIB5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(92)90140-Q_BIB6","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning a graph","volume":"49","author":"Kernighan","year":"1970","journal-title":"The Bell System Tech. J."},{"key":"10.1016\/0020-0190(92)90140-Q_BIB7","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1109\/SFCS.1988.21958","article-title":"An approximate max-flow min-cut theorem for multicommodity flow problems with applications to approximation algorithms","author":"Leighton","year":"1988","journal-title":"Proc. 29th Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(92)90140-Q_BIB8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","article-title":"A separator theorem for planar graphs","volume":"36","author":"Lipton","year":"1979","journal-title":"SIAM J. Appl. Math."},{"issue":"2","key":"10.1016\/0020-0190(92)90140-Q_BIB9","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1137\/0219018","article-title":"A heuristic algorithm for small separators in arbitrary graphs","volume":"19","author":"Plaisted","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90140-Q_BIB10","first-page":"225","article-title":"Finding near optimal separators in planar graphs","author":"Rao","year":"1987","journal-title":"Proc. 29th Symp. on Foundations of Computer Science"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290140Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290140Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T10:39:08Z","timestamp":1580899148000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290140Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["002001909290140Q"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90140-q","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}