{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:05:35Z","timestamp":1725897935014},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298912"},{"type":"electronic","value":"9783642298929"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29892-9_10","type":"book-chapter","created":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T16:34:23Z","timestamp":1340642063000},"page":"45-60","source":"Crossref","is-referenced-by-count":3,"title":["A Peep through the Looking Glass: Articulation Points in Lattices"],"prefix":"10.1007","author":[{"given":"Anne","family":"Berry","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Sigayret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Yevtushenko, S.A.: System of data analysis \u201dConcept Explorer\u201d. In: Proc. 7th Nat. Conf. on Artif. Intell. KII 2000, Ru., pp.127\u2013134 (2000) (in Russian), \n                    \n                      http:\/\/conexp.sourceforge.net\/download.html\n                    \n                    \n                  , release 1.3. \u00a9 Yevtushenko, S.A., et al. (2000-2006)"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.disc.2005.12.002","volume":"306","author":"A. Berry","year":"2006","unstructured":"Berry, A., Heggernes, P., Villanger, Y.: A vertex incremental approach for maintaining chordality. Discrete Mathematics\u00a0306, 318\u2013336 (2006)","journal-title":"Discrete Mathematics"},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"197","DOI":"10.3390\/a3020197","volume":"3","author":"A. Berry","year":"2010","unstructured":"Berry, A., Pogorelcnik, R., Simonet, G.: An introduction to clique minimal separator decomposition. Algorithms\u00a03(2), 197\u2013215 (2010)","journal-title":"Algorithms"},{"issue":"1-2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.dam.2004.02.016","volume":"144","author":"A. Berry","year":"2004","unstructured":"Berry, A., Sigayret, A.: Representing a concept lattice by a graph. Discrete Applied Mathematics\u00a0144(1-2), 27\u201342 (2004)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.jalgor.2004.07.001","volume":"58","author":"A. Berry","year":"2006","unstructured":"Berry, A., Bordat, J.-P., Heggernes, P., Simonet, G., Villanger, Y.: A wide-range algorithm for minimal triangulation from an arbitrary ordering. Journal of Algorithms\u00a058(1), 33\u201366 (2006)","journal-title":"Journal of Algorithms"},{"key":"10_CR6","unstructured":"Birkhoff, G.: Lattice Theory, 3rd edn. American Mathematical Society (1967)"},{"key":"10_CR7","first-page":"31","volume":"96","author":"J.-P. Bordat","year":"1986","unstructured":"Bordat, J.-P.: Calcul pratique du treillis de Galois d\u2019une correspondance. Math\u00e9matiques, Informatique et Sciences Humaines\u00a096, 31\u201347 (1986)","journal-title":"Math\u00e9matiques, Informatique et Sciences Humaines"},{"issue":"1-3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.disc.2004.08.046","volume":"299","author":"A. Brandst\u00e4dt","year":"2005","unstructured":"Brandst\u00e4dt, A., Hammer, P.L., Le, V.B., Lozin, V.V.: Bisplit graphs. Discrete Mathematics\u00a0299(1-3), 11\u201332 (2005)","journal-title":"Discrete Mathematics"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Math. Appl., Philadelphia, Vol. 3, (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"10_CR10","unstructured":"Carroll, L.: Through the Looking-Glass, and What Alice Found There (1871)"},{"key":"10_CR11","unstructured":"Caspard, N., Leclerc, B., Monjardet, B.: Ensembles ordonn\u00e9s finis: concepts, r\u00e9sultats et usages. Math\u00e9mathiques et Applications 60 (2007)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis. Springer (1999)","DOI":"10.1007\/978-3-642-59830-2"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1142\/S0129054103001625","volume":"14","author":"J.-L. Fouquet","year":"2003","unstructured":"Fouquet, J.-L., Giakoumakis, V., Vanherpe, J.-M.: Linear Time Recognition and Optimizations for Weak-Bisplit Graphs, Bi-Cographs and Bipartite P6-Free Graphs. International Journal of Foundations of Computer Science\u00a014(1), 107\u2013136 (2003)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"4","key":"10_CR14","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1142\/S0129054199000368","volume":"10","author":"J.-L. Fouquet","year":"1999","unstructured":"Fouquet, J.-L., Giakoumakis, V., Vanherpe, J.-M.: Bipartite Graphs Totally Decomposable by Canonical Decomposition. International Journal of Foundations of Computer Science\u00a010(4), 513\u2013534 (1999)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"10_CR15","first-page":"87","volume":"14","author":"P. Heggernes","year":"2007","unstructured":"Heggernes, P., Kratsch, D.: Linear-time certifying recognition algorithms and forbidden induced subgraphs. Nordic Journal of Computing\u00a014, 87\u2013108 (2007)","journal-title":"Nordic Journal of Computing"},{"issue":"3","key":"10_CR16","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.dam.2004.10.001","volume":"146","author":"D. Meister","year":"2005","unstructured":"Meister, D.: Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs. Discr. Appl. Math.\u00a0146(3), 193\u2013218 (2005)","journal-title":"Discr. Appl. Math."},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-60084-1_68","volume-title":"Automata, Languages and Programming","author":"A. Parra","year":"1995","unstructured":"Parra, A., Scheffler, P.: How to Use the Minimal Separators of a Graph for Its Chordal Triangulation. In: F\u00fcl\u00f6p, Z. (ed.) ICALP 1995. LNCS, vol.\u00a0944, pp. 123\u2013134. Springer, Heidelberg (1995)"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Spinrad, J.P.: Efficient Graph Representations. American Mathematical Society (2003)","DOI":"10.1090\/fim\/019"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29892-9_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:20:01Z","timestamp":1620127201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29892-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298912","9783642298929"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29892-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}