Maximum weighted edge biclique problem on bipartite graphs
DOI10.1007/978-3-030-39219-2_10zbMATH Open1453.68143OpenAlexW3002003116MaRDI QIDQ779184
Arti Pandey, Nivedit Jain, Gopika Sharma
Publication date: 21 July 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-39219-2_10
NP-completenessgraph algorithmschain graphsbipartite permutation graphsmaximum weighted edge biclique
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)
Related Items (5)
Recommendations
- Title not available (Why is that?) 👍 👎
- Finding maximum edge bicliques in convex bipartite graphs 👍 👎
- On maximum weight of a bipartite graph of given order and size 👍 👎
- Inapproximability of Maximum Weighted Edge Biclique and Its Applications 👍 👎
- The Maximum Induced Bipartite Subgraph Problem with Edge Weights 👍 👎
- Finding Maximum Edge Bicliques in Convex Bipartite Graphs 👍 👎
- Maximum matching of given weight in complete and complete bipartite graphs 👍 👎
- Parameterized Algorithms for Maximum Edge Biclique and Related Problems 👍 👎
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs 👍 👎
- On a max-min problem concerning weights of edges 👍 👎
This page was built for publication: Maximum weighted edge biclique problem on bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q779184)
