The Biclique Cover Problem and the Modified Galois Lattice-Reference-Cited by-同舟云学术

The Biclique Cover Problem and the Modified Galois Lattice

Published:2015 Issue:3 Volume:E98.D Page:497-502
ISSN:0916-8532
Container-title:IEICE Transactions on Information and Systems
language:en
Short-container-title:IEICE Trans. Inf. & Syst.

Author:

OTSUKI Hideaki¹,HIRATA Tomio²

Affiliation:

1. Department of Software Engineering, Nanzan University

2. Department of Computer Science and Mathematical Informatics, Nagoya University

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Artificial Intelligence,Electrical and Electronic Engineering,Computer Vision and Pattern Recognition,Hardware and Architecture,Software

Link

https://www.jstage.jst.go.jp/article/transinf/E98.D/3/E98.D_2014FCP0019/_pdf

Reference13 articles.

1. [1] H. Otsuki and T. Hirata, “The biclique cover problem and the modified Galois lattice,” IPSJ Trans. AL (in Japanese), vol.147, no.4, pp.1-4, Feb. 2014.

2. [2] P.C. Fishburn and P.L. Hammer, “Bipartite dimensions and bipartite degrees of graphs,” Discrete Mathematics, vol.160, no.1-3, pp.127-148, 1996.

3. [3] L. Stockmeyer, “The set basis problem is NP-complete,” Tech. Rep. RC-5431, IBM, 1975.

4. [4] A. Lubiw, “The boolean basis problem and how to cover some polygons by rectangles,” SIAM J. Discret. Math., vol.3, no.1, pp.98-115, Jan. 1990.

5. [5] R. Wille, “Restructuring lattice theory: An approach based on hierarchies of concepts,” in Formal Concept Analysis, ed. S. Ferre and S. Rudolph, Lecture Notes in Computer Science, vol.5548, pp.314-339, Springer Berlin Heidelberg, 2009.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A New Polynomial-Time Solvable Graph Class for the Minimum Biclique Edge Cover Problem;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2020-10-01