{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,5]],"date-time":"2023-12-05T09:40:58Z","timestamp":1701769258043},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1980,8,1]],"date-time":"1980-08-01T00:00:00Z","timestamp":333936000000},"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":12038,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1980,8]]},"DOI":"10.1016\/0022-0000(80)90042-2","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"63-86","source":"Crossref","is-referenced-by-count":35,"title":["An efficient PQ-graph algorithm for solving the graph-realization problem"],"prefix":"10.1016","volume":"21","author":[{"given":"Satoru","family":"Fujishige","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(80)90042-2_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0022-0000(80)90042-2_BIB2","doi-asserted-by":"crossref","unstructured":"R. E. Bixby and W. H. Cunningham, Converting linear programs to network problems, Math. Operations Res., in press.","DOI":"10.1287\/moor.5.3.321"},{"key":"10.1016\/0022-0000(80)90042-2_BIB3","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. System Sci."},{"key":"10.1016\/0022-0000(80)90042-2_BIB4","series-title":"Proceedings, International Symposium on Circuits and Systems","first-page":"1012","article-title":"An efficient algorithm for solving the graph-realization problem by means of PQ-trees","author":"Fujishige","year":"1979"},{"key":"10.1016\/0022-0000(80)90042-2_BIB5","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1002\/sapm1958371193","article-title":"Graphs and vector spaces","volume":"37","author":"Gould","year":"1958","journal-title":"J. Math. Phys."},{"issue":"No. 50","key":"10.1016\/0022-0000(80)90042-2_BIB6_1","article-title":"A necessary and sufficient condition for a matrix to be the loop or cut-set matrix of a graph and a practical method for the topological synthesis of networks","author":"Iri","year":"1962","journal-title":"RAAG Res. Notes, Ser. 3"},{"key":"10.1016\/0022-0000(80)90042-2_BIB6_2","first-page":"4","article-title":"On the synthesis of loop and cutset matrices and the related problems","volume":"5","author":"Iri","year":"1968","journal-title":"RAAG Mem. A"},{"key":"10.1016\/0022-0000(80)90042-2_BIB7","series-title":"Network Flow, Transportation and Scheduling: Theory and Algorithm","author":"Iri","year":"1969"},{"key":"10.1016\/0022-0000(80)90042-2_BIB8","series-title":"Graph Theory","author":"Mayeda","year":"1972"},{"key":"10.1016\/0022-0000(80)90042-2_BIB9","series-title":"Linear Graphs and Electrical Networks","author":"Seshu","year":"1961"},{"key":"10.1016\/0022-0000(80)90042-2_BIB10","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","article-title":"Efficiency of a good but not linear set union algorithm","volume":"22","author":"Tarjan","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(80)90042-2_BIB11","series-title":"Papers of the Technical Group on Circuit and System Theory","article-title":"An O(m3) algorithm for solving the realization problem of graphs\u2014On combinatorial characterizations of graphic (0, 1)-matrices","author":"Tomizawa","year":"1976"},{"key":"10.1016\/0022-0000(80)90042-2_BIB12","first-page":"905","article-title":"An algorithm for determining whether a given binary matroid is graphic","volume":"11","author":"Tutte","year":"1960"},{"key":"10.1016\/0022-0000(80)90042-2_BIB13","doi-asserted-by":"crossref","first-page":"108","DOI":"10.4153\/CJM-1964-011-0","article-title":"From matrices to graphs","volume":"16","author":"Tutte","year":"1964","journal-title":"Canad. J. Math."},{"key":"10.1016\/0022-0000(80)90042-2_BIB14","series-title":"Connectivity in Graphs","author":"Tutte","year":"1966"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000080900422?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000080900422?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:29:27Z","timestamp":1550323767000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000080900422"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,8]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1980,8]]}},"alternative-id":["0022000080900422"],"URL":"http:\/\/dx.doi.org\/10.1016\/0022-0000(80)90042-2","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1980,8]]}}}
