Pages that link to "Item:Q1414242"
From MaRDI portal
The following pages link to The maximum edge biclique problem is NP-complete (Q1414242):
Displayed 50 items.
- Reducing rank of the adjacency matrix by graph modification (Q344771) (← links)
- Summarizing transactional databases with overlapped hyperrectangles (Q408648) (← links)
- A simple filter for detecting low-rank submatrices (Q419636) (← links)
- Bicolored independent sets and bicliques (Q436317) (← links)
- A note on a maximum \(k\)-subset intersection problem (Q436571) (← links)
- On the inapproximability of maximum intersection problems (Q456103) (← links)
- Clique problem, cutting plane proofs and communication complexity (Q456115) (← links)
- Graph-based data clustering with overlaps (Q456688) (← links)
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs (Q496657) (← links)
- Generating bicliques of a graph in lexicographic order (Q557825) (← links)
- Consensus algorithms for the generation of all maximal bicliques (Q705493) (← links)
- Nuclear norm minimization for the planted clique and biclique problems (Q717132) (← links)
- Rank reduction of oriented graphs by vertex and edge deletions (Q722520) (← links)
- A continuous characterization of the maximum-edge biclique problem (Q742133) (← links)
- Multi-objective evolutionary biclustering of gene expression data (Q850158) (← links)
- Finding biclusters by random projections (Q859851) (← links)
- Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation (Q896191) (← links)
- Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs (Q896655) (← links)
- Management and analysis of DNA microarray data by using weighted trees (Q925235) (← links)
- Using underapproximations for sparse nonnegative matrix factorization (Q962750) (← links)
- A notion of cross-perfect bipartite graphs (Q1029000) (← links)
- Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables (Q1628128) (← links)
- On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion} (Q1679221) (← links)
- Partition of a binary matrix into \(k\) (\(k \geq 3\)) exclusive row and column submatrices is difficult (Q1719430) (← links)
- On the geometric interpretation of the nonnegative rank (Q1758469) (← links)
- Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
- Exact exponential-time algorithms for finding bicliques (Q1944039) (← links)
- Algorithms for induced biclique optimization problems (Q1944925) (← links)
- Coherent network partitions (Q2026346) (← links)
- Maximal-sum submatrix search using a hybrid constraint programming/linear programming approach (Q2060395) (← links)
- Subclasses of circular-arc bigraphs: Helly, normal and proper (Q2132386) (← links)
- Spike-and-slab Lasso biclustering (Q2233147) (← links)
- Coherent network partitions: characterizations with cographs and prime graphs (Q2243575) (← links)
- Complexity of modification problems for reciprocal best match graphs (Q2290642) (← links)
- Chromatic characterization of biclique covers (Q2368922) (← links)
- Finding preferred subsets of Pareto optimal solutions (Q2427390) (← links)
- Biclique completion problems for multicast network design (Q2427696) (← links)
- On independent sets and bicliques in graphs (Q2428684) (← links)
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth (Q2444525) (← links)
- A convexity upper bound for the number of maximal bicliques of a bipartite graph (Q2448895) (← links)
- Biclique-Helly graphs (Q2478166) (← links)
- A linear programming formulation for the maximum complete multipartite subgraph problem (Q2583129) (← links)
- \(k\)-partite cliques of protein interactions: a novel subgraph topology for functional coherence analysis on PPI networks (Q2632355) (← links)
- Scale reduction techniques for computing maximum induced bicliques (Q2633172) (← links)
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
- On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs (Q2633284) (← links)
- Parameterized algorithms for edge biclique and related problems (Q2636505) (← links)
- Bi-objective optimization of biclustering with binary data (Q2666768) (← links)
- The biclique k-clustering problem in bipartite graphs and its application in bioinformatics (Q2883562) (← links)
- Reducing Rank of the Adjacency Matrix by Graph Modification (Q3196399) (← links)