Publisher
Springer Science and Business Media LLC
Subject
Geometry and Topology,Theoretical Computer Science,Software
Reference23 articles.
1. Abello J, Pogel AJ, Miller L (2004) Breadth first search graph partitions and concept lattices. J. Univers Comput Sci 10(8):934–954
2. Amilhastre J, Vilarem MC, Janssen P (1998) Complexity of minimum biclique cover and minimum biclique decomposition for bipartite deminofree graphs. Discret Appl Math 86:125–144
3. Apollonio N, Caramia M, Franciosa PG (2015) On the Galois lattice of bipartite distance hereditary graphs. Discret Appl Math 190–191:13–23
4. Bělohlǎvek R, Baets BD, Outrata J, Vychodil V (2008) Characterizing trees in concept lattices. Int J Uncertain Fuzz Knowl-Based Syst 16(1):1–15
5. Berry A, Sigayret A (2004) Representing a concept lattice by a graph. Discret Appl Math 144:27–42
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献