{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T01:31:32Z","timestamp":1648690292954},"reference-count":13,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2015]]},"DOI":"10.1587\/transinf.2014fcp0019","type":"journal-article","created":{"date-parts":[[2015,2,28]],"date-time":"2015-02-28T22:42:16Z","timestamp":1425163336000},"page":"497-502","source":"Crossref","is-referenced-by-count":1,"title":["The Biclique Cover Problem and the Modified Galois Lattice"],"prefix":"10.1587","volume":"E98.D","author":[{"given":"Hideaki","family":"OTSUKI","sequence":"first","affiliation":[{"name":"Department of Software Engineering, Nanzan University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomio","family":"HIRATA","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Mathematical Informatics, Nagoya University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] H. Otsuki and T. Hirata, \u201cThe biclique cover problem and the modified Galois lattice,\u201d IPSJ Trans. AL (in Japanese), vol.147, no.4, pp.1-4, Feb. 2014."},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] P.C. Fishburn and P.L. Hammer, \u201cBipartite dimensions and bipartite degrees of graphs,\u201d Discrete Mathematics, vol.160, no.1-3, pp.127-148, 1996.","DOI":"10.1016\/0012-365X(95)00154-O"},{"key":"3","unstructured":"[3] L. Stockmeyer, \u201cThe set basis problem is NP-complete,\u201d Tech. Rep. RC-5431, IBM, 1975."},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] A. Lubiw, \u201cThe boolean basis problem and how to cover some polygons by rectangles,\u201d SIAM J. Discret. Math., vol.3, no.1, pp.98-115, Jan. 1990.","DOI":"10.1137\/0403010"},{"key":"5","unstructured":"[5] R. Wille, \u201cRestructuring lattice theory: An approach based on hierarchies of concepts,\u201d in Formal Concept Analysis, ed. S. Ferre and S. Rudolph, Lecture Notes in Computer Science, vol.5548, pp.314-339, Springer Berlin Heidelberg, 2009."},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] D.S. Nau, G. Markowsky, M.A. Woodbury, and D.B. Amos, \u201cA mathematical analysis of human leukocyte antigen serology,\u201d Mathematical Biosciences, vol.40, no.3-4, pp.243-270, 1978.","DOI":"10.1016\/0025-5564(78)90088-3"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] J. Orlin, \u201cContentment in graph theory: Covering graphs with cliques,\u201d Indagationes Mathematicae (Proceedings), vol.80, no.5, pp.406-424, 1977.","DOI":"10.1016\/1385-7258(77)90055-5"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] H. Fleischner, E. Mujuni, D. Paulusma, and S. Szeider, \u201cCovering graphs with few complete bipartite subgraphs,\u201d Theor. Comput. Sci., vol.410, no.21-23, pp.2045-2053, 2009.","DOI":"10.1016\/j.tcs.2008.12.059"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] H. Muller, \u201cOn edge perfectness and classes of bipartite graphs,\u201d Discrete Mathematics, vol.149, no.1-3, pp.159-187, 1996.","DOI":"10.1016\/0012-365X(94)00350-R"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] J. Amilhastre, M. Vilarem, and P. Janssen, \u201cComplexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs,\u201d Discrete Appl. Math., vol.86, no.2-3, pp.125-144, 1998.","DOI":"10.1016\/S0166-218X(98)00039-0"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] R. Wille, \u201cConcept lattices and conceptual knowledge systems,\u201d Computers and Mathematics with Applications, vol.23, no.6-9, pp.493-515, 1992.","DOI":"10.1016\/0898-1221(92)90120-7"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] A. G\u00e9ly, L. Nourine, and B. Sadi, \u201cEnumeration aspects of maximal cliques and bicliques,\u201d Discrete Appl. Math., vol.157, no.7, pp.1447-1459, 2009.","DOI":"10.1016\/j.dam.2008.10.010"},{"key":"13","unstructured":"[13] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, 1st ed., Prentice Hall, 1993."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/3\/E98.D_2014FCP0019\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T06:29:48Z","timestamp":1498199388000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/3\/E98.D_2014FCP0019\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2014fcp0019","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}