Approximating Clique and Biclique Problems
From MaRDI portal
Publication:4217307
DOI10.1006/jagm.1998.0964zbMath0919.68056OpenAlexW2051006653MaRDI QIDQ4217307
Publication date: 11 November 1998
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/bd9ddaff977a9edc72b222a72c639b985240405f
Related Items
On the complexity of minimum \(q\)-domination partization problems ⋮ Scale reduction techniques for computing maximum induced bicliques ⋮ Parameterized algorithms for edge biclique and related problems ⋮ On Independent Sets and Bicliques in Graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Finding biclusters by random projections ⋮ Approximating power node-deletion problems ⋮ On independent sets and bicliques in graphs ⋮ Exact exponential-time algorithms for finding bicliques ⋮ An exact exponential time algorithm for counting bipartite cliques ⋮ The maximum edge biclique problem is NP-complete ⋮ Unnamed Item ⋮ A necessary condition for Nash equilibrium in two-person zero-sum constrained stochastic games ⋮ Unnamed Item ⋮ Parameterized Algorithms for Maximum Edge Biclique and Related Problems ⋮ Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties ⋮ Consensus algorithms for the generation of all maximal bicliques ⋮ An approximation ratio for biclustering ⋮ Generating bicliques of a graph in lexicographic order ⋮ Complexity of modification problems for reciprocal best match graphs ⋮ Complexity and approximations for submodular minimization problems on two variables per inequality constraints ⋮ On the generation of bicliques of a graph ⋮ A notion of cross-perfect bipartite graphs ⋮ Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations ⋮ Formulating logical implications in combinatorial optimisation
