Pages that link to "Item:Q1414242"
From MaRDI portal
The following pages link to The maximum edge biclique problem is NP-complete (Q1414242):
Displayed 23 items.
- Mixed Integer Programming for Searching Maximum Quasi-Bicliques (Q3294898) (← links)
- Inapproximability of Maximum Weighted Edge Biclique and Its Applications (Q3502654) (← links)
- Parameterized Algorithms for Maximum Edge Biclique and Related Problems (Q4632171) (← links)
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs (Q4632202) (← links)
- (Q4691855) (← links)
- Fractional minimal rank (Q4965572) (← links)
- (Q5020552) (← links)
- (Q5026980) (← links)
- Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices (Q5041266) (← links)
- The Bipartite QUBO (Q5050150) (← links)
- Topological Bounds for Graph Representations over Any Field (Q5150813) (← links)
- Biclique graphs and biclique matrices (Q5189236) (← links)
- On Independent Sets and Bicliques in Graphs (Q5302053) (← links)
- Graph-Based Data Clustering with Overlaps (Q5323099) (← links)
- Minimum‐weight subgraphs with unicyclic components and a lower‐bounded girth (Q5326798) (← links)
- On the generation of bicliques of a graph (Q5899361) (← links)
- Combinatorics and algorithms for quasi-chain graphs (Q5918620) (← links)
- On the generation of bicliques of a graph (Q5919931) (← links)
- Combinatorics and algorithms for quasi-chain graphs (Q5925628) (← links)
- (Q6065417) (← links)
- Spurious Valleys, NP-Hardness, and Tractability of Sparse Matrix Factorization with Fixed Support (Q6101122) (← links)
- Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← links)
- On computing large temporal (unilateral) connected components (Q6182912) (← links)