{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T17:02:39Z","timestamp":1648918959945},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1981,12,1]],"date-time":"1981-12-01T00:00:00Z","timestamp":376012800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1981,12]]},"DOI":"10.1007\/bf02237953","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T01:06:56Z","timestamp":1132016816000},"page":"343-354","source":"Crossref","is-referenced-by-count":6,"title":["An algorithm for generating all maximal independent subsets of posets"],"prefix":"10.1007","volume":"26","author":[{"given":"M.","family":"Bartusch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02237953_CR1","volume-title":"The design and analysis of computer algorithms","author":"A. V. Aho","year":"1974","unstructured":"Aho, A. V., Hopcraft, J. E., Ullmann, J. D.: The design and analysis of computer algorithms. Reading, Mass.: Addison-Wesley 1974."},{"key":"BF02237953_CR2","volume-title":"Principles of combinatorics","author":"C. Berge","year":"1971","unstructured":"Berge, C.: Principles of combinatorics. London: Academic Press 1971."},{"key":"BF02237953_CR3","series-title":"Graduate texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-9967-7","volume-title":"Graph theory","author":"B. Bollobas","year":"1979","unstructured":"Bollobas, B.: Graph theory. (Graduate texts in Mathematics, Vol. 63.) New York: Springer 1979."},{"key":"BF02237953_CR4","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1017\/S0305004100053056","volume":"80","author":"B. Bollobas","year":"1976","unstructured":"Bollobas, B., Erd\u00f6s, P.: Cliques in random graphs. Math. Proc. Camb. Phil. Soc.80, 419\u2013427 (1976).","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"BF02237953_CR5","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C. Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457, Finding all cliques of an undirected graph. Comm. ACM16, 575\u2013577 (1973).","journal-title":"Comm. ACM"},{"key":"BF02237953_CR6","first-page":"259","volume":"37","author":"H. Buer","year":"1980","unstructured":"Buer, H., M\u00f6hring, R. H.: A fast algorithm for the decomposition of graphs and acyclic networks (extended abstract). Forthcoming in Oper. Res. Verfahren37, 259\u2013263 (1980).","journal-title":"Forthcoming in Oper. Res. Verfahren"},{"key":"BF02237953_CR7","series-title":"Proc. Symp. Appl. Math.","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1090\/psapm\/010\/0115940","volume-title":"Some combinatorial problems on partially ordered sets in \u201cCombinatorial Analysis\u201d","author":"R. P. Dilworth","year":"1960","unstructured":"Dilworth, R. P.: Some combinatorial problems on partially ordered sets in \u201cCombinatorial Analysis\u201d. Proc. Symp. Appl. Math., Vol. 10, pp. 85\u201390. Providence, R. I.: American Mathematical Society 1960."},{"key":"BF02237953_CR8","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1145\/321707.321710","volume":"19","author":"S. Even","year":"1972","unstructured":"Even, S., Pnueli, A., Lempel, A.: Permutation graphs and transitive graphs. J. of the Ass. f. Comp. Mach.19, 400\u2013410 (1972).","journal-title":"J. of the Ass. f. Comp. Mach."},{"key":"BF02237953_CR9","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF02248731","volume":"21","author":"L. Gerhards","year":"1979","unstructured":"Gerhards, L., Lindenberg, W.: Clique detection for nondirected graphs: Two new algorithms. Computing21, 295\u2013322 (1979).","journal-title":"Computing"},{"key":"BF02237953_CR10","doi-asserted-by":"crossref","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","volume":"16","author":"P. C. Gilmore","year":"1964","unstructured":"Gilmore, P. C., Hoffmann, A. J.: A characterization of comparability graphs and of interval graphs. Can. J. Math.16, 539\u2013548 (1964).","journal-title":"Can. J. Math."},{"key":"BF02237953_CR11","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0095-8956(77)90049-1","volume":"22","author":"M. C. Golumbic","year":"1977","unstructured":"Golumbic, M. C.: Comparability graphs and a new matroid. J. of comb. Theory (B)22, 68\u201390 (1977).","journal-title":"J. of comb. Theory (B)"},{"key":"BF02237953_CR12","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF02253207","volume":"18","author":"M. C. Golumbic","year":"1977","unstructured":"Golumbic, M. C.: The complexity of comparability graph recognition and coloring. Computing18, 199\u2013208 (1977).","journal-title":"Computing"},{"key":"BF02237953_CR13","first-page":"4","volume":"20","author":"S. Gorenstein","year":"1972","unstructured":"Gorenstein, S.: An algorithm for project (Job) sequencing with resource constraints. Operations Research20, 4 (1972).","journal-title":"Operations Research"},{"key":"BF02237953_CR14","first-page":"1","volume":"27","author":"R. Kaerkes","year":"1976","unstructured":"Kaerkes, R.: Netzplan-Theorie. Operations-Research-Verfahren27, 1\u201365 (1976).","journal-title":"Operations-Research-Verfahren"},{"key":"BF02237953_CR15","volume-title":"Combinatorial optimization: Networks and matroids","author":"E. L. Lawler","year":"1976","unstructured":"Lawler, E. L.: Combinatorial optimization: Networks and matroids. New York: Holt, Rinehart and Winston 1976."},{"key":"BF02237953_CR16","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1080\/00029890.1971.11992886","volume":"78","author":"L. Mirsky","year":"1971","unstructured":"Mirsky, L.: A dual of Dilworth's decomposition theorem. Amer. Math. Monthly78, 876\u2013877 (1971).","journal-title":"Amer. Math. Monthly"},{"key":"BF02237953_CR17","series-title":"Mathematical Systems in Economics","volume-title":"Kapazit\u00e4tsoptimierung in Netzpl\u00e4nen","author":"F. J. Radermacher","year":"1978","unstructured":"Radermacher, F. J.: Kapazit\u00e4tsoptimierung in Netzpl\u00e4nen. (Mathematical Systems in Economics, Band 40.) Meisenheim am Glan: Verlag Anton Hain 1978."},{"key":"BF02237953_CR18","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, H., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. Siam J. Comput.6, 505\u2013517 (1977).","journal-title":"Siam J. Comput."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02237953.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02237953\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02237953","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T17:02:22Z","timestamp":1557939742000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02237953"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,12]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1981,12]]}},"alternative-id":["BF02237953"],"URL":"https:\/\/doi.org\/10.1007\/bf02237953","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,12]]}}}