{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:03:24Z","timestamp":1720051404901},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,7,31]],"date-time":"2021-07-31T00:00:00Z","timestamp":1627689600000},"content-version":"vor","delay-in-days":1491,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1016\/j.dam.2017.04.004","type":"journal-article","created":{"date-parts":[[2017,4,26]],"date-time":"2017-04-26T02:15:55Z","timestamp":1493172955000},"page":"1-9","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On computing the Galois lattice of bipartite distance hereditary graphs"],"prefix":"10.1016","volume":"226","author":[{"given":"Nicola","family":"Apollonio","sequence":"first","affiliation":[]},{"given":"Paolo Giulio","family":"Franciosa","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2017.04.004_br000005","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF02574385","article-title":"Can visibility graphs be represented compactly?","volume":"12","author":"Agarwal","year":"1994","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.dam.2017.04.004_br000010","unstructured":"Alexandre Albano, Bogdan Chornomaz, Why concept lattices are large - extremal theory for the number of minimal generators and formal concepts, in: Proceedings of the Twelfth International Conference on Concept Lattices and their Applications, Clermont-Ferrand, France, October 13\u201316, 2015, pp. 73\u201386."},{"key":"10.1016\/j.dam.2017.04.004_br000015","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.dam.2013.01.014","article-title":"A convexity upper bound for the number of maximal bicliques of a bipartite graph","volume":"165","author":"Albano","year":"2014","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.dam.2017.04.004_br000020","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.dam.2003.09.004","article-title":"Consensus algorithms for the generation of all maximal bicliques","volume":"145","author":"Alexe","year":"2004","journal-title":"Discrete Appl. Math."},{"issue":"2\u20133","key":"10.1016\/j.dam.2017.04.004_br000025","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0166-218X(98)00039-0","article-title":"Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs","volume":"86","author":"Amilhastre","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2017.04.004_br000030","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.dam.2015.03.014","article-title":"On the Galois lattice of bipartite distance hereditary graphs","volume":"190\u2013191","author":"Apollonio","year":"2015","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.dam.2017.04.004_br000035","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","article-title":"Distance-hereditary graphs","volume":"41","author":"Bandelt","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1\u20134","key":"10.1016\/j.dam.2017.04.004_br000040","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s10472-007-9063-4","article-title":"A local approach to concept generation","volume":"49","author":"Berry","year":"2007","journal-title":"Ann. Math. Artif. Intell."},{"key":"10.1016\/j.dam.2017.04.004_br000045","doi-asserted-by":"crossref","unstructured":"Anne Berry, Ross M. McConnell, Alain Sigayret, Jeremy P. Spinrad, Very fast instances for concept generation, in: Formal Concept Analysis, 4th International Conference, ICFCA 2006, Dresden, Germany, February 13\u201317, 2006, Proceedings, 2006, pp. 119\u2013129.","DOI":"10.1007\/11671404_8"},{"key":"10.1016\/j.dam.2017.04.004_br000050","doi-asserted-by":"crossref","unstructured":"Anne Berry, Alain Sigayret, Dismantlable lattices in the mirror, in: Formal Concept Analysis, 11th International Conference, ICFCA 2013, Dresden, Germany, May 21\u201324, 2013. Proceedings, 2013, pp. 44\u201359.","DOI":"10.1007\/978-3-642-38317-5_3"},{"issue":"1","key":"10.1016\/j.dam.2017.04.004_br000055","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/moor.13.1.99","article-title":"An almost linear-time algorithm for graph realization","volume":"13","author":"Bixby","year":"1988","journal-title":"Math. Oper. Res."},{"issue":"5","key":"10.1016\/j.dam.2017.04.004_br000060","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/j.disc.2006.01.010","article-title":"Chromatic characterization of biclique covers","volume":"306","author":"Cornaz","year":"2006","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/j.dam.2017.04.004_br000065","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","article-title":"A linear recognition algorithm for cographs","volume":"14","author":"Corneil","year":"1985","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"10.1016\/j.dam.2017.04.004_br000070","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0304-3975(00)00234-6","article-title":"A simple paradigm for graph recognition: application to cographs and distance hereditary graphs","volume":"263","author":"Damiand","year":"2001","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/j.dam.2017.04.004_br000075","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0020-0190(94)90121-X","article-title":"Arboricity and bipartite subgraph listing algorithms","volume":"51","author":"Eppstein","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.dam.2017.04.004_br000080","series-title":"Formal Concept Analysis - Mathematical Foundations","author":"Ganter","year":"1999"},{"issue":"1\u20132","key":"10.1016\/j.dam.2017.04.004_br000085","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(90)90131-U","article-title":"Completely separable graphs","volume":"27","author":"Hammer","year":"1990","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.dam.2017.04.004_br000090","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\/j.dam.2017.04.004_br000095","series-title":"Combinatorial Optimization: Theory and Algorithms","author":"Korte","year":"2007"},{"issue":"4","key":"10.1016\/j.dam.2017.04.004_br000100","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1023\/A:1013970520933","article-title":"On computing the size of a lattice and related decision problems","volume":"18","author":"Kuznetsov","year":"2001","journal-title":"Order"},{"issue":"12","key":"10.1016\/j.dam.2017.04.004_br000105","doi-asserted-by":"crossref","first-page":"1625","DOI":"10.1109\/TKDE.2007.190660","article-title":"Maximal biclique subgraphs and closed pattern pairs of the adjacency matrix: A one-to-one correspondence and mining algorithms","volume":"19","author":"Li","year":"2007","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.dam.2017.04.004_br000110","doi-asserted-by":"crossref","unstructured":"Kazuhisa Makino, Takeaki Uno, New algorithms for enumerating all maximal cliques, in: Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8\u201310, 2004, Proceedings, 2004, pp. 260\u2013272.","DOI":"10.1007\/978-3-540-27810-8_23"},{"issue":"1","key":"10.1016\/j.dam.2017.04.004_br000115","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s004930070035","article-title":"Bicliques in graphs I: bounds on their number","volume":"20","author":"Prisner","year":"2000","journal-title":"Combinatorica"},{"issue":"3","key":"10.1016\/j.dam.2017.04.004_br000120","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0166-218X(95)80005-O","article-title":"The arborescence-realization problem","volume":"59","author":"Swaminathan","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2017.04.004_br000125","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1186\/1471-2105-15-110","article-title":"On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types","volume":"15","author":"Zhang","year":"2014","journal-title":"BMC Bioinform."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X17301592?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X17301592?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,7,31]],"date-time":"2021-07-31T06:02:37Z","timestamp":1627711357000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X17301592"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":25,"alternative-id":["S0166218X17301592"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2017.04.004","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2017,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On computing the Galois lattice of bipartite distance hereditary graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2017.04.004","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}