Approximating Clique and Biclique Problems
From MaRDI portal
Recommendations
- Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization
- On bipartite and multipartite clique problems
- scientific article; zbMATH DE number 4135976
- On the clique editing problem
- Approximating element-weighted vertex deletion problems for the complete k-partite property
Cited in
(42)- A notion of cross-perfect bipartite graphs
- A new approach for approximating node deletion problems
- The maximum edge biclique problem is NP-complete
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
- Formulating logical implications in combinatorial optimisation
- Complexity and approximations for submodular minimization problems on two variables per inequality constraints
- Exact exponential-time algorithms for finding bicliques
- On the complexity of minimum \(q\)-domination partization problems
- Complexity of modification problems for reciprocal best match graphs
- Near optimal solutions for maximum quasi-bicliques
- On independent sets and bicliques in graphs
- Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization
- Scale reduction techniques for computing maximum induced bicliques
- Parameterized algorithms for edge biclique and related problems
- Approximating 2-cliques in unit disk graphs
- On bipartite and multipartite clique problems
- Approximating element-weighted vertex deletion problems for the complete k-partite property
- On Fast Enumeration of Pseudo Bicliques
- ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS
- Inapproximability of Maximum Weighted Edge Biclique and Its Applications
- Near optimal solutions for maximum quasi-bicliques
- An exact exponential time algorithm for counting bipartite cliques
- A necessary condition for Nash equilibrium in two-person zero-sum constrained stochastic games
- Parameterized algorithms for maximum edge biclique and related problems
- Problems and invariants connected with bicliques and multicliques of graphs
- The complexity for the problems of covering of a graph with the minimum number of complete bipartite subgraphs
- 2-approximation algorithm for finding a clique with minimum weight of vertices and edges
- Approximation Algorithms for the k-Clique Covering Problem
- Approximating rank-width and clique-width quickly
- Mutex graphs and multicliques: reducing grounding size for planning
- Structural properties of biclique graphs and the distance formula
- On approximating the number of k-cliques in sublinear time
- On Independent Sets and Bicliques in Graphs
- Generating bicliques of a graph in lexicographic order
- On the generation of bicliques of a graph
- Approximating power node-deletion problems
- Approximation algorithm for minimum \(q\)-dominator partization problem
- Approximating power node-deletion problems
- Consensus algorithms for the generation of all maximal bicliques
- Finding biclusters by random projections
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
- An approximation ratio for biclustering
This page was built for publication: Approximating Clique and Biclique Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4217307)
