共 50 条
- [31] Computing a minimum biclique cover is polynomial for bipartite domino-free graphs [J]. PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, : 36 - 42
- [34] Fractional biclique covers and partitions of graphs [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2006, 13 (01):
- [35] Biclique cryptanalysis using balanced complete bipartite subgraphs [J]. Science China Information Sciences, 2016, 59
- [36] POLYNOMIAL REPRESENTATIONS OF THE BICLIQUE NEIGHBORHOOD OF GRAPHS [J]. ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2023, 37 : 37 - 45
- [37] POLYNOMIAL REPRESENTATIONS OF THE BICLIQUE NEIGHBORHOOD OF GRAPHS [J]. ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2023, 37 : 37 - 45