Parameterized algorithms for edge biclique and related problems
From MaRDI portal
Publication:2636505
DOI10.1016/j.tcs.2017.09.027zbMath1393.68132OpenAlexW2757784722MaRDI QIDQ2636505
Qilong Feng, Jianxin Wang, Zeyang Zhou, Shao-hua Li
Publication date: 5 June 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.09.027
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
Computing dense and sparse subgraphs of weakly closed graphs ⋮ Improved PTAS for the constrained \(k\)-means problem ⋮ Unnamed Item ⋮ An improved kernel for max-bisection above tight lower bound ⋮ An approximation algorithm for the \(l\)-pseudoforest deletion problem
Cites Work
- A survey of the algorithmic aspects of modular decomposition
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
- Partition on trees with supply and demand: kernelization and algorithms
- Improved kernel results for some FPT problems based on simple observations
- Approximating maximum agreement forest on multiple binary trees
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
- Recognizing the \(P_4\)-structure of bipartite graphs
- The maximum edge biclique problem is NP-complete
- Fixed-parameter complexity in AI and nonmonotonic reasoning
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- Parameterized computational complexity of Dodgson and Young elections
- Algorithmic and complexity issues of three clustering methods in microarray data analysis
- Managing Broader Product Lines through Delayed Differentiation Using Vanilla Boxes
- BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES
- Inapproximability of Maximum Weighted Edge Biclique and Its Applications
- Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms
- Approximating Clique and Biclique Problems
- Learning Theory and Kernel Machines
- Algorithm Theory - SWAT 2004
- Parameterized Algorithms
This page was built for publication: Parameterized algorithms for edge biclique and related problems
