{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T18:12:42Z","timestamp":1725646362783},"reference-count":29,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"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":5768,"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":[[1997,10]]},"DOI":"10.1016\/s0166-218x(97)00027-9","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"189-205","source":"Crossref","is-referenced-by-count":54,"title":["Recognizing interval digraphs and interval bigraphs in polynomial time"],"prefix":"10.1016","volume":"78","author":[{"given":"Haiko","family":"M\u00fcller","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00027-9_BIB1","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0012-365X(82)90147-9","article-title":"Connection digraphs and second order line graphs","volume":"39","author":"Beineke","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(97)00027-9_BIB2","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1137\/S089548019223992X","article-title":"Treewidth and pathwidth of permutation graphs","volume":"8","author":"Bodlaender","year":"1995","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(97)00027-9_BIB3","article-title":"Special graph classes \u2014 a survey","author":"Brandst\u00e4dt","year":"1993"},{"key":"10.1016\/S0166-218X(97)00027-9_BIB4","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0166-218X(91)90023-P","article-title":"Classes of Bipartite Graphs Related to Chordal Graphs","volume":"32","author":"Brandst\u00e4dt","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(97)00027-9_BIB5","series-title":"Chordale Graphen im besonderen Hinblick auf parallele Algorithmen","author":"Dahlhaus","year":"1989"},{"key":"10.1016\/S0166-218X(97)00027-9_BIB6","series-title":"Proceedings of the 11th Symposium on Theoretical Aspects of Computer Science","first-page":"747","article-title":"On vertex ranking for permutation and other graphs","volume":"vol. 775","author":"Deogun","year":"1994"},{"key":"10.1016\/S0166-218X(97)00027-9_BIB7","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","article-title":"On rigid circuit graphs","volume":"25","author":"Dirac","year":"1961","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"10.1016\/S0166-218X(97)00027-9_BIB8","first-page":"67","article-title":"Classical perfect graphs","volume":"21","author":"Duchet","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(97)00027-9_BIB9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","article-title":"Characterizations of strongly chordal graphs","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(97)00027-9_BIB10","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","article-title":"The intersection graphs of subtrees in trees are exactly the chordal graphs","volume":"B 16","author":"Gavril","year":"1974","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0166-218X(97)00027-9_BIB11","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(97)00027-9_BIB12","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0095-8956(77)90049-1","article-title":"Comparability graphs and a new matroid","volume":"B 22","author":"Golumbic","year":"1977","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0166-218X(97)00027-9_BIB13","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0166-218X(97)00027-9_BIB14","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1002\/jgt.3190020209","article-title":"Perfect elimination and chordal bipartite graphs","volume":"2","author":"Golumbic","year":"1978","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(97)00027-9_BIB15","article-title":"A characterization of chordal bipartite graphs","author":"Hammer","year":"1989"},{"issue":"4","key":"10.1016\/S0166-218X(97)00027-9_BIB16","first-page":"739","article-title":"Bipartite Intersection Graphs","volume":"23","author":"Harary","year":"1982","journal-title":"Comment. Math. Univ. Carolin"},{"key":"10.1016\/S0166-218X(97)00027-9_BIB17","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0095-8956(85)90050-4","article-title":"Weakly triangulated graphs","volume":"B 39","author":"Hayward","year":"1985","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0166-218X(97)00027-9_BIB18_1","first-page":"5","article-title":"A bipartite theory of graphs","volume":"55","author":"Hedetniemi","year":"1986"},{"key":"10.1016\/S0166-218X(97)00027-9_BIB18_2","first-page":"137","article-title":"A bipartite theory of graphs","volume":"64","author":"Hedetniemi","year":"1988"},{"key":"10.1016\/S0166-218X(97)00027-9_BIB19","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0020-0190(95)00027-A","article-title":"Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph","volume":"55","author":"Kloks","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(97)00027-9_BIB20","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","article-title":"Representation of a finite graph by a set of intervals on the real line","volume":"51","author":"Lekkerkerker","year":"1962","journal-title":"Fund. Math."},{"key":"10.1016\/S0166-218X(97)00027-9_BIB21","doi-asserted-by":"crossref","first-page":"303","DOI":"10.4064\/fm-33-1-303-307","article-title":"Sur deux propri\u00e9t\u00e9s des classes d'ensembles","volume":"33","author":"Marczewski","year":"1945","journal-title":"Fund. Math."},{"key":"10.1016\/S0166-218X(97)00027-9_BIB22","first-page":"261","article-title":"Bipartite analogs of graph theory","volume":"60","author":"McKee","year":"1987"},{"key":"10.1016\/S0166-218X(97)00027-9_BIB23","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0012-365X(85)90047-0","article-title":"Characterizing intersection classes of graphs","volume":"55","author":"Scheinerman","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(97)00027-9_BIB24","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1002\/jgt.3190130206","article-title":"Interval digraphs: an analogue of interval graphs","volume":"13","author":"Sen","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(97)00027-9_BIB25","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1137\/S0895480190177145","article-title":"Indifference digraphs: a generalization of indifference graphs","volume":"7","author":"Sen","year":"1994","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(97)00027-9_BIB26","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(97)00027-9_BIB27","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1002\/(SICI)1097-0118(199602)21:2<235::AID-JGT14>3.0.CO;2-I","article-title":"The recognition of indifference digraphs and generalized semiorders","volume":"21","author":"Steiner","year":"1996","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(97)00027-9_BIB28","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1137\/0210022","article-title":"Node-deletion problems on bipartite graphs","volume":"10","author":"Yannakakis","year":"1981","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000279?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000279?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T10:03:55Z","timestamp":1578477835000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97000279"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":29,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["S0166218X97000279"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00027-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}