|
| Hideaki OTSUKI
|
A New Polynomial-Time Solvable Graph Class for the Minimum Biclique Edge Cover Problem
Hideaki OTSUKI | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2020/10/01
Vol. E103-A
No. 10
pp. 1202-1205
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: optimization
Keyword:
biclique, edge cover, | | | Summary | Full Text:PDF | |
|
The Biclique Cover Problem and the Modified Galois Lattice
Hideaki OTSUKI Tomio HIRATA | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2015/03/01
Vol. E98-D
No. 3
pp. 497-502
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science---New Spirits in Theory of Computation and Algorithm---)
Category:
Keyword:
biqlique cover, Galois lattice, domino-free, | | | Summary | Full Text:PDF | |
|
Inapproximability of the Minimum Biclique Edge Partition Problem
Hideaki OTSUKI Tomio HIRATA | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2010/02/01
Vol. E93-D
No. 2
pp. 290-292
Type of Manuscript:
Special Section LETTER (Special Section on Foundations of Computer Science)
Category:
Keyword:
biclique, edge partition, NP-hard, inapproximability, | | | Summary | Full Text:PDF | |
| |
|
|
|