Linear-time algorithm for generating c-isolated bicliques

References

• Z. Alamgir, S. Karim, and S. Husnine, On efficient enumeration of pseudobicliques, Processings of the International Workshop on Combinatorial Algorithms (IWOCA), Lecture Notes in Computer Science, Vol. 6460, 2010, pp. 256–259.
   Google Scholar
• G. Bai and H. Fernau, Constraint bipartite vertex cover: Simpler exact algorithms and implementations, J. Comb. Optim. 23(3) (2012), pp. 331–355.
   Web of Science ®Google Scholar
• J. Couturier, P. Heggernes, P. Hof, and D. Kratsch, Minimal dominating sets in graph classes: Combinatorial bounds and enumeration, Theoret. Comput. Sci. 487 (2013), pp. 82–94.
   Web of Science ®Google Scholar
• V.M.F. Dias, C.M.H. Figueiredo, and J.L. Szwarcfiter, On the generation of bicliques of a graph, Discrete Appl. Math. 155 (2007), pp. 1826–1832.
   Web of Science ®Google Scholar
• R.G. Downey and M.R. Fellows, Parameterized Complexity, Springer-Verlag, New York, 1999.
   Google Scholar
• H. Fernau, On parameterized enumeration, Proceedings of the 8th Annual International Conference on Computing and Combinatorics (COCOON), Lecture Notes in Computer Science, Vol. 2387, 2002, pp. 564–573.
   Google Scholar
• H. Fernau, Parameterized algorithmics: A graph-theoretic approach, Habilitationsschrift, Universitat Tubingen, Germany, 2005.
   Google Scholar
• H. Fernau and R. Niedermeier, An efficient exact algorithm for constraint bipartite vertex cover, J. Algorithms 38 (2001), pp. 374–410.
   Web of Science ®Google Scholar
• S. Gaspers, D. Kratsch, and M. Liedloff, On independent sets and bicliques in graphs, Algorithmica 62 (2012), pp. 637–658.
   Web of Science ®Google Scholar
• J.-L. Guillaume and M. Latapy, Bipartite graphs as models of complex networks, Phys. A 371(2) (2006), pp. 795–813.
   Web of Science ®Google Scholar
• M. Hamilton, R. Chaytor, and T. Wareham, The parameterized complexity of enumerating frequent itemsets, Proceedings of the Second International Conference on Parameterized and Exact Computation (IWPEC), Vol. 3669, 2006, pp. 27–238. doi:10.1007/11847250_21.
   Google Scholar
• F. Hüffner, C. Komusiewicz, H. Moser, and R. Niedermeier, Isolation concepts for clique enumeration: Comparison and computational experiments, Theoret. Comput. Sci. 410 (2009), pp. 5384–5397.
   Web of Science ®Google Scholar
• H. Ito and K. Iwama, Enumeration of isolated cliques and pseudo-cliques, ACM Trans. Algorithms 5(40) (2009), pp. 1–21.
   Web of Science ®Google Scholar
• H. Ito, K. Iwama, and H. Miyagawa, Linear time enumeration of isolated bicliques with part size proportion bounded by constants, Technical Committee on Theoretical Foundations of Computing COMP 19 (2007), pp. 9–16.
   Google Scholar
• H. Ito, K. Iwama, and T. Osumi, Linear-time enumeration of isolated cliques, Proceedings of the 13th Annual European Symposium on Algorithms, Lecturer Notes in Computer Science, Vol. 3669, 2005, pp. 119–130.
   Google Scholar
• S. Karim, Z. Alamgir, and S. Husnine, Generating bracelets with fixed content, Theoret. Comput. Sci. 475 (2013), pp. 103–112.
   Web of Science ®Google Scholar
• D.E. Knuth, Art of Computer Programming, Vol. 4, Addison-Wesley, Upper Saddle River, NJ, 2005.
   Google Scholar
• C. Komusiewicz, F. Hüffner, H. Moser, and R. Niedermeier, Isolation concepts for efficiently enumerating dense subgraphs, Theoret. Comput. Sci. 410 (2009), pp. 3640–3654.
   Web of Science ®Google Scholar
• M. Krzywkowski, Trees having many minimal dominating sets, Inform. Process. Lett. 113 (2013), pp. 276–279.
   Web of Science ®Google Scholar
• J. Li, G. Liu, H. Li, and L. Wong, Maximal biclique subgraphs and closed pattern pairs of the adjacency matrix: A one-to-one correspondence and mining algorithms, IEEE Trans. Knowledge Data Eng. 19 (2007), pp. 1625–1637.
   Web of Science ®Google Scholar
• J. Li, K. Sim, G. Liu, and L. Wong, Maximal quasi-bicliques with balanced noise tolerance: Concepts and co-clustering applications, Proceedings of SIAM Conference on Data Mining (SDM), 2008, pp. 72–83.
   Google Scholar
• T. Matsunaga, C. Yonemori, E. Tomita, and M. Muramatsu, Clique-based data mining for related genes in a biomedical database, BMC Bioinformatics 10 (2009), pp. 1–9.
   PubMed Web of Science ®Google Scholar
• T. Murata, Discovery of user communities based on terms of web log data, New Gener. Comput. 25 (2007), pp. 293–303.
   Web of Science ®Google Scholar
• S.M. Zadeh, P. Brézellec, and J.-L. Risler, Cluster-c, an algorithm for the large-scale clustering of protein sequences based on the extraction of maximal cliques, Comput. Biol. Chem. 28 (2004), pp. 211–218.
   PubMed Web of Science ®Google Scholar