Finding maximum edge bicliques in convex bipartite graphs
From MaRDI portal
Redirect page
Recommendations
- Finding maximum edge bicliques in convex bipartite graphs
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs
- Maximum weighted edge biclique problem on bipartite graphs
- A convexity upper bound for the number of maximal bicliques of a bipartite graph
- Parameterized algorithms for maximum edge biclique and related problems
- Finding all maximally-matchable edges in a bipartite graph
- A continuous characterization of the maximum-edge biclique problem
- Computing maximum non-crossing matching in convex bipartite graphs
- Computing maximum non-crossing matching in convex bipartite graphs
- Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
Cites work
- A linear time algorithm for maximum matchings in convex, bipartite graphs
- A log log n data structure for three-sided range queries
- Algorithms and Computation
- Algorithms for maximum independent set in convex bipartite graphs
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
- Consensus algorithms for the generation of all maximal bicliques
- Dynamic Matchings in Convex Bipartite Graphs
- Efficient parallel algorithms for doubly convex-bipartite graphs
- Enumeration aspects of maximal cliques and bicliques
- Finding the largest area axis-parallel rectangle in a polygon
- Generating bicliques of a graph in lexicographic order
- Geometric applications of a matrix-searching algorithm
- Graph Classes: A Survey
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 877297 (Why is no real title available?)
- Inapproximability of Maximum Weighted Edge Biclique and Its Applications
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- Maximum matching in a convex bipartite graph
- Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs
- On bipartite and multipartite clique problems
- On finding large conjunctive clusters.
- On the consecutive ones property
- On the generation of bicliques of a graph
- Relations between average case complexity and approximation complexity
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The maximum edge biclique problem is NP-complete
Cited in
(15)- Biconvex graphs: Ordering and algorithms
- A biclique approach to reference anchored gene blocks and its applications to pathogenicity islands
- Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs
- A convexity upper bound for the number of maximal bicliques of a bipartite graph
- Scale reduction techniques for computing maximum induced bicliques
- Finding maximum edge bicliques in convex bipartite graphs
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs
- Problems and invariants connected with bicliques and multicliques of graphs
- The bipartite QUBO
- Total domination and open packing in some subclasses of bipartite graphs
- Exact algorithms for the maximum k-balanced weighted biclique problem
- Finding maximum edge bicliques in tree convex graphs
- A continuous characterization of the maximum-edge biclique problem
- Maximum weighted edge biclique problem on bipartite graphs
- Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs
This page was built for publication: Finding maximum edge bicliques in convex bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1759663)
