Pages that link to "Item:Q2775896"
From MaRDI portal
The following pages link to On Bipartite and Multipartite Clique Problems (Q2775896):
Displaying 33 items.
- A note on the complexity of the causal ordering problem (Q309924) (← links)
- Finding clubs in graph classes (Q400518) (← links)
- Bicolored independent sets and bicliques (Q436317) (← links)
- Generating bicliques of a graph in lexicographic order (Q557825) (← links)
- Consensus algorithms for the generation of all maximal bicliques (Q705493) (← links)
- Finding biclusters by random projections (Q859851) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- A notion of cross-perfect bipartite graphs (Q1029000) (← links)
- Partition of a binary matrix into \(k\) (\(k \geq 3\)) exclusive row and column submatrices is difficult (Q1719430) (← links)
- Micro-review synthesis for multi-entity summarization (Q1741329) (← links)
- Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs (Q1749486) (← links)
- Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
- On the maximal size of large-average and ANOVA-fit submatrices in a Gaussian random matrix (Q1940759) (← links)
- Exact exponential-time algorithms for finding bicliques (Q1944039) (← links)
- Regarding two conjectures on clique and biclique partitions (Q2121747) (← links)
- Complexity of modification problems for reciprocal best match graphs (Q2290642) (← links)
- Efficient approximation for restricted biclique cover problems (Q2331611) (← links)
- On independent sets and bicliques in graphs (Q2428684) (← links)
- A novel approach to fault tolerant multichannel networks designing problems (Q2442936) (← links)
- Scale reduction techniques for computing maximum induced bicliques (Q2633172) (← links)
- Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract) (Q2988848) (← links)
- Inapproximability of Maximum Weighted Edge Biclique and Its Applications (Q3502654) (← links)
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs (Q4632202) (← links)
- (Q4691855) (← links)
- (Q4691865) (← links)
- (Q5026980) (← links)
- The Bipartite QUBO (Q5050150) (← links)
- Quantile Inverse Optimization: Improving Stability in Inverse Linear Programming (Q5106382) (← links)
- Simple Undirected Graphs as Formal Contexts (Q5255665) (← links)
- On Independent Sets and Bicliques in Graphs (Q5302053) (← links)
- On the generation of bicliques of a graph (Q5899361) (← links)
- On the generation of bicliques of a graph (Q5919931) (← links)
- Exchange networks with stochastic matching (Q6555563) (← links)