Finding Maximum Edge Bicliques in Convex Bipartite Graphs
From MaRDI portal
Publication:3578311
DOI10.1007/978-3-642-14031-0_17zbMath1286.05169OpenAlexW1490843286WikidataQ62037456 ScholiaQ62037456MaRDI QIDQ3578311
Doron Nussbaum, Shuye Pu, Takeaki Uno, Hamid Zarrabi-Zadeh, Jörg-Rüdiger Sack
Publication date: 20 July 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.874.6788
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
An Integer Programming Formulation for the Maximum k-Subset Intersection Problem ⋮ Solving the maximum edge biclique packing problem on unbalanced bipartite graphs ⋮ Linear-time algorithm for the paired-domination problem in convex bipartite graphs ⋮ On list \(k\)-coloring convex bipartite graphs
This page was built for publication: Finding Maximum Edge Bicliques in Convex Bipartite Graphs