On Bipartite and Multipartite Clique Problems

DOI10.1006/jagm.2001.1199zbMath1017.68088OpenAlexW2109291623WikidataQ56603354 ScholiaQ56603354MaRDI QIDQ2775896

Jayashankar M. Swaminathan, Pinar Keskinocak, Milind W. Dawande, Sridhar R. Tayur

Publication date: 8 July 2002

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4392d950120075769d68bfedc6d5476425870c54

zbMATH Keywords

bipartite graphsmultipartite graphsmanufacturing problems

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

The Bipartite QUBO, A note on the complexity of the causal ordering problem, Scale reduction techniques for computing maximum induced bicliques, On Independent Sets and Bicliques in Graphs, Unnamed Item, Unnamed Item, Finding biclusters by random projections, Finding clubs in graph classes, Inapproximability of Maximum Weighted Edge Biclique and Its Applications, Quantile Inverse Optimization: Improving Stability in Inverse Linear Programming, On the maximal size of large-average and ANOVA-fit submatrices in a Gaussian random matrix, On independent sets and bicliques in graphs, Exact exponential-time algorithms for finding bicliques, Bicolored independent sets and bicliques, A novel approach to fault tolerant multichannel networks designing problems, Partition of a binary matrix into \(k\) (\(k \geq 3\)) exclusive row and column submatrices is difficult, Unnamed Item, Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract), Maximum Edge Bicliques in Tree Convex Bipartite Graphs, Micro-review synthesis for multi-entity summarization, Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs, Finding maximum edge bicliques in convex bipartite graphs, Consensus algorithms for the generation of all maximal bicliques, Generating bicliques of a graph in lexicographic order, On the generation of bicliques of a graph, Complexity of modification problems for reciprocal best match graphs, On the generation of bicliques of a graph, Combinatorial optimization in system configuration design, A notion of cross-perfect bipartite graphs, Efficient approximation for restricted biclique cover problems, Simple Undirected Graphs as Formal Contexts