{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T03:26:20Z","timestamp":1787714780951,"version":"build-2784847793"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319592701","type":"print"},{"value":"9783319592718","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-59271-8_6","type":"book-chapter","created":{"date-parts":[[2017,5,18]],"date-time":"2017-05-18T11:59:07Z","timestamp":1495108747000},"page":"89-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["FCA in a Logical Programming Setting for Visualization-Oriented Graph Compression"],"prefix":"10.1007","author":[{"given":"Lucas","family":"Bourneuf","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jacques","family":"Nicolas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,5,19]]},"reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/BF02574385","volume":"12","author":"PK Agarwal","year":"1994","unstructured":"Agarwal, P.K., Alon, N., Aronov, B., Suri, S.: Can visibility graphs be represented compactly? Discret. Comput. Geom. 12(3), 347\u2013365 (1994)","journal-title":"Discret. Comput. Geom."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Ahnert, S.E.: Generalised power graph compression reveals dominant relationship patterns in complex networks. Sci. Rep. 4, Article no. 4385 (2014). https:\/\/www.nature.com\/articles\/srep04385","DOI":"10.1038\/srep04385"},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.dam.2003.09.004","volume":"145","author":"G Alexe","year":"2004","unstructured":"Alexe, G., Alexe, S., Crama, Y., Foldes, S., Hammer, P.L., Simeone, B.: Consensus algorithms for the generation of all maximal bicliques. Discret. Appl. Math. 145(1), 11\u201321 (2004). Graph Optimization IV","journal-title":"Discret. Appl. Math."},{"issue":"2\u20133","key":"6_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0166-218X(98)00039-0","volume":"86","author":"J Amilhastre","year":"1998","unstructured":"Amilhastre, J., Vilarem, M., Janssen, P.: Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs. Discret. Appl. Math. 86(2\u20133), 125\u2013144 (1998)","journal-title":"Discret. Appl. Math."},{"issue":"9","key":"6_CR5","doi-asserted-by":"publisher","first-page":"2443","DOI":"10.1093\/nar\/gkg340","volume":"31","author":"D Bu","year":"2003","unstructured":"Bu, D., Zhao, Y., Cai, L., Xue, H., Zhu, X., Lu, H., Zhang, J., Sun, S., Ling, L., Zhang, N., Li, G., Chen, R.: Topological structure analysis of the protein\u2013protein interaction network in budding yeast. Nucleic Acids Res. 31(9), 2443\u20132450 (2003)","journal-title":"Nucleic Acids Res."},{"key":"6_CR6","unstructured":"Chein, M.: Algorithme de recherche des sous-matrices premi\u00c8res d\u2019une matrice. Bulletin math\u00e9matique de la Soci\u00e9t\u00e9 des Sciences Math\u00e9matiques de la R\u00e9publique Socialiste de Roumanie 13(61)(1), 21\u201325 (1969)"},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0012-365X(80)90109-0","volume":"30","author":"F Chung","year":"1980","unstructured":"Chung, F.: On the coverings of graphs. Discret. Math. 30(2), 89\u201393 (1980)","journal-title":"Discret. Math."},{"issue":"7","key":"6_CR8","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1039\/c2ib00154c","volume":"4","author":"S Daminelli","year":"2012","unstructured":"Daminelli, S., Haupt, V.J., Reimann, M., Schroeder, M.: Drug repositioning through incomplete bi-cliques in an integrated drug\u2013target\u2013disease network. Integr. Biol. 4(7), 778\u2013788 (2012)","journal-title":"Integr. Biol."},{"issue":"12","key":"6_CR9","doi-asserted-by":"publisher","first-page":"2596","DOI":"10.1109\/TVCG.2013.151","volume":"19","author":"T Dwyer","year":"2013","unstructured":"Dwyer, T., Henry Riche, N., Marriott, K., Mears, C.: Edge compression techniques for visualization of dense directed graphs. IEEE Trans. Vis. Comput. Graph. 19(12), 2596\u20132605 (2013)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Dwyer, T., Mears, C., Morgan, K., Niven, T., Marriott, K., Wallace, M.: Improved optimal and approximate power graph compression for clearer visualisation of dense graphs. CoRR, abs\/1311.6996 (2013)","DOI":"10.1109\/PacificVis.2014.46"},{"issue":"4","key":"6_CR11","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0020-0190(94)90121-X","volume":"51","author":"D Eppstein","year":"1994","unstructured":"Eppstein, D.: Arboricity and bipartite subgraph listing algorithms. Inf. Process. Lett. 51(4), 207\u2013211 (1994)","journal-title":"Inf. Process. Lett."},{"issue":"8","key":"6_CR12","doi-asserted-by":"publisher","first-page":"R57","DOI":"10.1186\/gb-2004-5-8-r57","volume":"5","author":"J Gagneur","year":"2004","unstructured":"Gagneur, J., Krause, R., Bouwmeester, T., Casari, G.: Modular decomposition of protein-protein interaction networks. Genome Biol. 5(8), R57 (2004)","journal-title":"Genome Biol."},{"key":"6_CR13","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Lindauer, M., Ostrowski, M., Romero, J., Schaub, T., Thiele, S.: Potassco User Guide (2015)"},{"issue":"2","key":"6_CR14","doi-asserted-by":"crossref","first-page":"107","DOI":"10.3233\/AIC-2011-0491","volume":"24","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Schneider, M.: Potassco: the Potsdam answer set solving collection. AI Commun. 24(2), 107\u2013124 (2011)","journal-title":"AI Commun."},{"key":"6_CR15","unstructured":"Gelfond, M., Lifschitz, V.: Logic programs with classical negation. In: Proceedings of 7th International Conference on Logic Programming (ICLP), pp. 579\u201397 (1990)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/11787181_19","volume-title":"Conceptual Structures: Inspiration and Application","author":"P Hitzler","year":"2006","unstructured":"Hitzler, P., Kr\u00f6tzsch, M.: Querying formal contexts with answer set programs. In: Sch\u00e4rfe, H., Hitzler, P., \u00d8hrstr\u00f8m, P. (eds.) ICCS-ConceptStruct 2006. LNCS, vol. 4068, pp. 260\u2013273. Springer, Heidelberg (2006). doi:10.1007\/11787181_19"},{"issue":"10","key":"6_CR17","doi-asserted-by":"publisher","first-page":"3399","DOI":"10.1016\/j.disc.2008.09.036","volume":"309","author":"S Jukna","year":"2009","unstructured":"Jukna, S., Kulikov, A.: On covering graphs by complete bipartite subgraphs. Discret. Math. 309(10), 3399\u20133403 (2009)","journal-title":"Discret. Math."},{"issue":"17","key":"6_CR18","doi-asserted-by":"publisher","first-page":"3013","DOI":"10.1093\/bioinformatics\/bth351","volume":"20","author":"AD King","year":"2004","unstructured":"King, A.D., Pr\u017eulj, N., Jurisica, I.: Protein complex prediction via cost-based clustering. Bioinformatics 20(17), 3013\u20133020 (2004)","journal-title":"Bioinformatics"},{"issue":"D1","key":"6_CR19","doi-asserted-by":"publisher","first-page":"D321","DOI":"10.1093\/nar\/gku1091","volume":"43","author":"G Launay","year":"2015","unstructured":"Launay, G., Salza, R., Multedo, D., Thierry-Mieg, N., Ricard-Blum, S.: Matrixdb, the extracellular matrix interaction database: updated content, a new navigator and expanded functionalities. Nucleic Acids Res. 43(D1), D321\u2013D327 (2015)","journal-title":"Nucleic Acids Res."},{"key":"6_CR20","unstructured":"Lifschitz, V.: What is answer set programming? In: Proceedings of 23rd National Conference on Artificial Intelligence, AAAI 2008, vol. 3, pp. 1594\u20131597. AAAI Press (2008)"},{"issue":"2","key":"6_CR21","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1089\/cmb.2008.11TT","volume":"16","author":"S Navlakha","year":"2009","unstructured":"Navlakha, S., Schatz, M.C., Kingsford, C.: Revealing biological modules via graph summarization. J. Comput. Biol. 16(2), 253\u2013264 (2009)","journal-title":"J. Comput. Biol."},{"issue":"20","key":"6_CR22","doi-asserted-by":"publisher","first-page":"4021","DOI":"10.1093\/nar\/28.20.4021","volume":"28","author":"H Ogata","year":"2000","unstructured":"Ogata, H., Fujibuchi, W., Goto, S., Kanehisa, M.: A heuristic graph comparison algorithm and its application to detect functionally related enzyme clusters. Nucleic Acids Res. 28(20), 4021\u20134028 (2000)","journal-title":"Nucleic Acids Res."},{"issue":"7","key":"6_CR23","doi-asserted-by":"publisher","first-page":"e1000108","DOI":"10.1371\/journal.pcbi.1000108","volume":"4","author":"L Royer","year":"2008","unstructured":"Royer, L., Reimann, M., Andreopoulos, B., Schroeder, M.: Unraveling protein networks with power graph analysis. PLoS Comput. Biol. 4(7), e1000108 (2008)","journal-title":"PLoS Comput. Biol."},{"key":"6_CR24","unstructured":"Rudolph, S., S\u0103c\u0103rea, C., Troanc\u0103, D.: Membership constraints in formal concept analysis. In: Proceedings of 24th International Conference on Artificial Intelligence, IJCAI 2015, pp. 3186\u20133192. AAAI Press (2015)"},{"issue":"11","key":"6_CR25","doi-asserted-by":"publisher","first-page":"2498","DOI":"10.1101\/gr.1239303","volume":"13","author":"P Shannon","year":"2003","unstructured":"Shannon, P., Markiel, A., Ozier, O., Baliga, N.S., Wang, J.T., Ramage, D.E.A.: Cytoscape: a software environment for integrated models of biomolecular interaction networks. Genome Res. 13(11), 2498\u20132504 (2003)","journal-title":"Genome Res."},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Tsatsaronis, G., Reimann, M., Varlamis, I., Gkorgkas, O., N\u00f8rv\u00e5g, K.: Efficient community detection using power graph analysis. In: Proceedings of 9th Workshop on Large-Scale and Distributed Informational Retrieval, pp. 21\u201326. ACM (2011)","DOI":"10.1145\/2064730.2064738"},{"key":"6_CR27","unstructured":"Wucher, V.: Modeling of a gene network between mRNAs and miRNAs to predict gene functions involved in phenotypic plasticity in the pea aphid. Thesis, Universit\u00e9 Rennes 1, November 2014"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59271-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T11:24:07Z","timestamp":1710329047000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-59271-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319592701","9783319592718"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59271-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"19 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICFCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Concept Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rennes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icfca2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icfca2017.irisa.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}