{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:47:22Z","timestamp":1725493642343},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_21","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:04:43Z","timestamp":1193472283000},"page":"192-201","source":"Crossref","is-referenced-by-count":2,"title":["Matroid Representation of Clique Complexes"],"prefix":"10.1007","author":[{"given":"Kenji","family":"Kashiwabara","sequence":"first","affiliation":[]},{"given":"Yoshio","family":"Okamoto","sequence":"additional","affiliation":[]},{"given":"Takeaki","family":"Uno","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1002\/(SICI)1097-0118(199603)21:3<267::AID-JGT2>3.0.CO;2-O","volume":"21","author":"L. Cai","year":"1996","unstructured":"L. Cai, D. Corneil and A. Proskurowski: A generalization of line graphs: (X, Y)-intersection graphs. Journal of Graph Theory 21 (1996) 267\u2013287.","journal-title":"Journal of Graph Theory"},{"key":"21_CR2","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"R. Diestel: Graph Theory (2nd Edition). Springer Verlag, New York, 2000.","edition":"2nd Edition"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J. Edmonds","year":"1971","unstructured":"J. Edmonds: Matroids and the greedy algorithm. Mathematical Programming 1 (1971) 127\u2013136.","journal-title":"Mathematical Programming"},{"key":"21_CR4","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1017\/CBO9781107325715.011","volume-title":"Combinatorial Geometries","author":"U. Faigle","year":"1987","unstructured":"U. Faigle: Matroids in combinatorial optimization. In: Combinatorial Geometries (N. White, ed.), Cambridge University Press, Cambridge, 1987, pp. 161\u2013210."},{"key":"21_CR5","unstructured":"S.P. Fekete, R.T. Firla and B. Spille: Characterizing matchings as the intersection of matroids. Preprint, December 2002, arXiv:math.CO\/0212235."},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0196-6774(81)90032-8","volume":"2","author":"A. Frank","year":"1981","unstructured":"A. Frank: A weighted matroid intersection algorithm. Journal of Algorithms 2 (1981) 328\u2013336.","journal-title":"Journal of Algorithms"},{"key":"21_CR7","unstructured":"T.A. Jenkyns: The efficacy of the \u201cgreedy\u201d algorithm. Proceedings of the 7th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Utilitas Mathematica, Winnipeg, 1976, pp. 341\u2013350."},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0167-5060(08)70322-4","volume-title":"Algorithmic Aspects of Combinatorics; Annals of Discrete Mathematic","author":"B. Korte","year":"1978","unstructured":"B. Korte and D. Hausmann: An analysis of the greedy algorithm for independence systems. In: Algorithmic Aspects of Combinatorics; Annals of Discrete Mathematic 2 (B. Alspach et al., eds.), North-Holland, Amsterdam, 1978, pp. 65\u201374."},{"key":"21_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21711-5","volume-title":"Combinatorial Optimization","author":"B. Korte","year":"2002","unstructured":"B. Korte and J. Vygen: Combinatorial Optimization (2nd Edition). Springer Verlag, Berlin Heidelberg, 2002.","edition":"2nd Edition"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Y. Okamoto: Submodularity of some classes of the combinatorial optimization games. Mathematical Methods of Operations Research 58 (2003), to appear.","DOI":"10.1007\/s001860300284"},{"key":"21_CR11","volume-title":"Matroid Theory","author":"J. Oxley","year":"1992","unstructured":"J. Oxley: Matroid Theory. Oxford University Press, New York, 1992."},{"key":"21_CR12","first-page":"193","volume":"40","author":"F. Protti","year":"2002","unstructured":"F. Protti and J.L. Szwarcfiter: Clique-inverse graphs of bipartite graphs. Journal of Combinatorial Mathematics and Combinatorial Computing 40 (2002) 193\u2013203.","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1112\/plms\/s3-7.1.300","volume":"7","author":"R. Rado","year":"1957","unstructured":"R. Rado: Note on independence functions. Proceedings of the London Mathematical Society 7 (1957) 300\u2013320.","journal-title":"Proceedings of the London Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T15:50:06Z","timestamp":1551023406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}