Maximum weighted edge biclique problem on bipartite graphs
type: Item
instance of: scholarly article
title: Maximum weighted edge biclique problem on bipartite graphs
zbMATH Open document ID: 1453.68143
DOI: 10.1007/978-3-030-39219-2_10
author: Arti Pandey
author: Gopika Sharma
author: Nivedit Jain
publication date: 2020-07-21T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7223690
zbMATH Keywords: maximum weighted edge biclique
zbMATH Keywords: bipartite permutation graphs
zbMATH Keywords: chain graphs
zbMATH Keywords: NP-completeness
zbMATH Keywords: graph algorithms
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-030-39219-2 10
OpenAlex ID: W3002003116
Recommended article: The Maximum Induced Bipartite Subgraph Problem with Edge Weights
Recommended article: Q3983239
Recommended article: Finding Maximum Edge Bicliques in Convex Bipartite Graphs
Recommended article: Finding maximum edge bicliques in convex bipartite graphs
Recommended article: Inapproximability of Maximum Weighted Edge Biclique and Its Applications
Recommended article: Maximum Edge Bicliques in Tree Convex Bipartite Graphs
Recommended article: On maximum weight of a bipartite graph of given order and size
Recommended article: Parameterized Algorithms for Maximum Edge Biclique and Related Problems
Recommended article: Maximum matching of given weight in complete and complete bipartite graphs
Recommended article: On a max-min problem concerning weights of edges
description: scientific article; zbMATH DE number 7223690