Maximum Edge Bicliques in Tree Convex Bipartite Graphs
From MaRDI portal
Publication:4632202
NP-completenesspolynomial timestar-convex bipartite graphsmaximum edge bicliquetree-convex bipartite graphstriad-convex bipartite graphs
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Recommendations
- Finding maximum edge bicliques in convex bipartite graphs
- On bipartite and multipartite clique problems
- Finding maximum edge bicliques in convex bipartite graphs
- A convexity upper bound for the number of maximal bicliques of a bipartite graph
- Counting independent sets in tree convex bipartite graphs
Cites work
- A continuous characterization of the maximum-edge biclique problem
- Algorithms and Computation
- Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits
- Circular convex bipartite graphs: feedback vertex set
- Circular convex bipartite graphs: feedback vertex sets
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
- Consensus algorithms for the generation of all maximal bicliques
- Domination in some subclasses of bipartite graphs
- Enumeration aspects of maximal cliques and bicliques
- Feedback Vertex Sets on Tree Convex Bipartite Graphs
- Feedback vertex sets on restricted bipartite graphs
- Finding maximum edge bicliques in convex bipartite graphs
- Generating bicliques of a graph in lexicographic order
- Graph Classes: A Survey
- Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
- Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs
- Independent domination on tree convex bipartite graphs
- Maximum matching in a convex bipartite graph
- On bipartite and multipartite clique problems
- On the generation of bicliques of a graph
- Relations between average case complexity and approximation complexity
- Restricted Bipartite Graphs: Comparison and Hardness Results
- Set cover, set packing and hitting set for tree convex and tree-like set systems
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
- The maximum edge biclique problem is NP-complete
- Tractable connected domination for restricted bipartite graphs
- Tractable connected domination for restricted bipartite graphs (extended abstract)
- Tractable feedback vertex sets in restricted bipartite graphs
- Tree Convex Bipartite Graphs: $\mathcal{NP}$ -Complete Domination, Hamiltonicity and Treewidth
- Two Hardness Results on Feedback Vertex Sets
- Union closed tree convex sets
Cited in
(8)- Finding maximum edge bicliques in convex bipartite graphs
- scientific article; zbMATH DE number 7029068 (Why is no real title available?)
- Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs
- Counting independent sets in tree convex bipartite graphs
- Maximum weighted edge biclique problem on bipartite graphs
- A continuous characterization of the maximum-edge biclique problem
- Finding maximum edge bicliques in convex bipartite graphs
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
This page was built for publication: Maximum Edge Bicliques in Tree Convex Bipartite Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632202)
