Parameterized Algorithms for Maximum Edge Biclique and Related Problems

DOI10.1007/978-3-319-39817-4_8zbMath1475.68240OpenAlexW2505071075MaRDI QIDQ4632171

Zeyang Zhou, Qilong Feng, Jianxin Wang

Publication date: 26 April 2019

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-39817-4_8

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)

Related Items

Scale reduction techniques for computing maximum induced bicliques

Cites Work

• Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
• On problems without polynomial kernels
• The maximum edge biclique problem is NP-complete
• Algorithmic and complexity issues of three clustering methods in microarray data analysis
• Managing Broader Product Lines through Delayed Differentiation Using Vanilla Boxes
• Inapproximability of Maximum Weighted Edge Biclique and Its Applications
• Approximating Clique and Biclique Problems
• Learning Theory and Kernel Machines