{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:49:23Z","timestamp":1743097763704,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637578"},{"type":"electronic","value":"9783540696438"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0024498","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T02:30:56Z","timestamp":1132367456000},"page":"184-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On greedy matching ordering and greedy matchable graphs"],"prefix":"10.1007","author":[{"given":"Feodor F.","family":"Dragan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0196-6774(84)90028-2","volume":"5","author":"R.P. Anstee","year":"1984","unstructured":"R.P. Anstee and M. Farber, Characterizations of totally balanced matrices, J. Algorithms, 5 (1984), 215\u2013230.","journal-title":"J. Algorithms"},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0022-0000(86)90018-8","volume":"33","author":"G. Ausiello","year":"1986","unstructured":"G. Ausiello, D. D'ATRI and M. Moscarini, Chordality properties on graphs and minimal conceptual connections in semantic data models, J. Computer and System Sciences, 33 (1986), 179\u2013202.","journal-title":"J. Computer and System Sciences"},{"key":"17_CR3","unstructured":"A. Brandst\u00e4dt, Special graph classes-A survey, Schriftenreihe des Fachbereichs Mathematik, SM-DU-199, Universit\u00e4t Duisburg, 1991."},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0012-365X(96)00070-2","volume":"171","author":"A. Brandst\u00e4dt","year":"1997","unstructured":"A. Brandst\u00e4dt, F.F. Dragan and F. Nicolai, LexBFS-orderings and powers of chordal graphs, Discrete Math., 171 (1997), 27\u201342.","journal-title":"Discrete Math."},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1137\/0605034","volume":"5","author":"G. J. Chang","year":"1984","unstructured":"G. J. Chang AND G.L. Nemhauser, The k-domination and k-stability problems on sun-free chordal graphs, SIAM J. Alg. Discrete Meth., 5 (1984), 332\u2013345.","journal-title":"SIAM J. Alg. Discrete Meth."},{"key":"17_CR6","unstructured":"E. Dalhaus and M. Karpinski, On the computational complexity of matching and multidimensional matching in chordal and strongly chordal graphs, Manuscript."},{"key":"17_CR7","unstructured":"F.F. Dragan, F. Nicolai and A. Brandst\u00e4dt, Convexity and HHD-free graphs, Technical Report Gerhard-Mercator-Universit\u00e4t-Gesamthochschule Duisburg SM-DU-290, 1995."},{"key":"17_CR8","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","volume":"43","author":"M. Farber","year":"1983","unstructured":"M. Farber, Characterization of strongly chordal graphs, Discrete Math., 43 (1983), 173\u2013189.","journal-title":"Discrete Math."},{"key":"17_CR9","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York 1980."},{"key":"17_CR10","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1002\/jgt.3190020209","volume":"2","author":"M.C. Golumbic","year":"1978","unstructured":"M.C. Golumbic and C.F. Goss, Perfect elimination and chordal bipartite graphs, J. Graph Theory, 2 (1978), 155\u2013163.","journal-title":"J. Graph Theory"},{"key":"17_CR11","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0095-8956(85)90050-4","volume":"39","author":"R. Hayward","year":"1985","unstructured":"R. Hayward, Weakly triangulated graphs, Journal of Combin. Theory (B), 39 (1985),200\u2013209.","journal-title":"Journal of Combin. Theory (B)"},{"key":"17_CR12","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0606070","volume":"6","author":"A.J. Hoffman","year":"1985","unstructured":"A.J. Hoffman, A.W.J. Kolen and M. Sakarovitch, Totally-balanced and greedy matrices, SIAM J. Alg. Disc. Meth., 6 (1985), 721\u2013730.","journal-title":"SIAM J. Alg. Disc. Meth."},{"issue":"28","key":"17_CR13","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1093\/qmath\/28.4.417","volume":"2","author":"E. Howorka","year":"1977","unstructured":"E. Howorka, A characterization of distance-hereditary graphs, Quart. J. Math. Oxford Ser. 2, 28 (1977), 417\u2013420.","journal-title":"Quart. J. Math. Oxford Ser."},{"key":"17_CR14","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/jgt.3190050314","volume":"5","author":"E. Howorka","year":"1981","unstructured":"E. Howorka, A characterization of ptolemaic graphs, J. Graph Theory, 5 (1981), 323\u2013331.","journal-title":"J. Graph Theory"},{"key":"17_CR15","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/0196-8858(88)90019-X","volume":"9","author":"B. Jamison","year":"1988","unstructured":"B. Jamison and S. Olariu, On the serni-perfect elimination, Advances in Applied Math. 9 (1988), 364\u2013376.","journal-title":"Advances in Applied Math."},{"key":"17_CR16","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0020-0190(95)00027-A","volume":"55","author":"T. Kloks","year":"1995","unstructured":"T. Kloks and D. Kratsch, Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph, Information Processing Letters 55 (1995) 11\u201316.","journal-title":"Information Processing Letters"},{"key":"17_CR17","unstructured":"L. Lov\u00e1sz and M.D. Plummer, Matching Theory, Ann. Discrete Math. 29 (1986)."},{"key":"17_CR18","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1137\/0216057","volume":"16","author":"A. Lubiw","year":"1987","unstructured":"A. Lubiw, Doubly lexical orderings of matrices, SIAM J. Comput. 16 (1987), 854\u2013879.","journal-title":"SIAM J. Comput"},{"key":"17_CR19","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"R. Paige and R.E. Tarjan, Three partition refinement algorithms, SIAM J. Cornput., 16 (1987), 973\u2013989.","journal-title":"SIAM J. Cornput."},{"key":"17_CR20","first-page":"179","volume-title":"Handbook of Combinatorics","author":"W.R. Pulleyblank","year":"1995","unstructured":"W.R. Pulleyblank, Matching and Extensions, in Handbook of Combinatorics (L.R. Graham, et al., eds.), Elsevier (Amsterdam) 1995, vol. 1, pp. 179\u2013232."},{"key":"17_CR21","unstructured":"M. Queyranne, F. Spieksma and F. T'ardella, A general class of greedily solvable linear programs, 3\n                  rd\n                IPCO Conference (G. Rinaldi and L. Wolsey, eds.), (1993) 385\u2013399."},{"key":"17_CR22","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D. Rose","year":"1976","unstructured":"D. Rose, R.E. Tarjan and G. Lueker, Algorithmic aspects on vertex elimination on graphs, SIAM J, Comput. 5 (1976), 266\u2013283.","journal-title":"SIAM J, Comput."},{"key":"17_CR23","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(93)90209-R","volume":"45","author":"J.P. Spinrad","year":"1993","unstructured":"J.P. Spinrad, Doubly lexical ordering of dense 0\u20131-matrices, Information Processing Letters 45 (1993) 229\u2013235.","journal-title":"Information Processing Letters"},{"key":"17_CR24","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R.E. Tarjan","year":"1984","unstructured":"R.E. Tarjan and M. Yannakakis, Simple linear time algorithms to test chordality of graphs, test acyclicity off hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput. 13 (1984), 566\u2013579.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024498","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:29:22Z","timestamp":1578526162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024498"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637578","9783540696438"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/bfb0024498","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"17 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}