A continuous characterization of the maximum-edge biclique problem

DOI10.1007/S10898-013-0053-2MaRDI QIDQ742133zbMATH OpenOpenAlexFDO

Authors Nicolas Gillis, François Glineur

Publication date 18 September 2014

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-013-0053-2

zbMATH Keywords

algorithmic complexitybiclique finding algorithmmaximum-edge biclique problemnonnegative rank-one approximation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Continuous Characterizations of the Maximum Clique Problem
• Parameterized algorithms for maximum edge biclique and related problems
• Finding maximum edge bicliques in convex bipartite graphs
• Finding maximum edge bicliques in convex bipartite graphs
• Maximum Edge Bicliques in Tree Convex Bipartite Graphs
• Maximum weighted edge biclique problem on bipartite graphs
• Inapproximability of Maximum Weighted Edge Biclique and Its Applications
• The maximum edge biclique problem is NP-complete
• A continuous characterization of the maximum vertex-weighted clique in hypergraphs
• A convexity upper bound for the number of maximal bicliques of a bipartite graph

Cites work

• A continuous characterization of the maximum-edge biclique problem
• Benchmarking optimization software with performance profiles.
• Consensus algorithms for the generation of all maximal bicliques
• Continuous Characterizations of the Maximum Clique Problem
• Evolution towards the maximum clique
• scientific article; zbMATH DE number 47363 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• Maxima for Graphs and a New Proof of a Theorem of Turán
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
• The maximum edge biclique problem is NP-complete

Cited in

(17)

• Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables
• Finding maximum edge bicliques in convex bipartite graphs
• A unified global convergence analysis of multiplicative update rules for nonnegative matrix factorization
• An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices
• Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation
• Descent methods for nonnegative matrix factorization
• Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
• Exact and heuristic algorithms for semi-nonnegative matrix factorization
• Global convergence of modified multiplicative updates for nonnegative matrix factorization
• Maximum Edge Bicliques in Tree Convex Bipartite Graphs
• Problems and invariants connected with bicliques and multicliques of graphs
• Rethinking arithmetic for deep neural networks
• The bipartite QUBO
• Accelerated SVD-based initialization for nonnegative matrix factorization
• Computing the least cone-constrained singular value of matrices
• A continuous characterization of the maximum-edge biclique problem
• New heuristic approaches for maximum balanced biclique problem

Describes a project that uses

Uses Software

• Gurobi

This page was built for publication: A continuous characterization of the maximum-edge biclique problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742133)