Problems and invariants connected with bicliques and multicliques of graphs
From MaRDI portal
Publication:4691855
zbMATH Open1459.05241MaRDI QIDQ4691855FDOQ4691855
Authors: V. V. Lepin, Oleg Duginov 
Publication date: 24 October 2018
Full work available at URL: http://mathnet.ru/eng/timb199
Recommendations
Cites Work
- A mathematical analysis of human leukocyte antigen serology
- On the Addressing Problem for Loop Switching
- Algorithms for finding biclique covers of graphs with bounded pathwidth
- Packing graphs: The packing problem solved
- On edge perfectness and classes of bipartite graphs
- Communication Complexity
- Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search
- Title not available (Why is that?)
- Some improved bounds on the information rate of perfect secret sharing schemes
- Title not available (Why is that?)
- Graph decompositions and secret sharing schemes
- On the existence of balanced bipartite designs. II
- Minimal NFA Problems are Hard
- On bipartite and multipartite clique problems
- Biclique graphs and biclique matrices
- Title not available (Why is that?)
- A weighted min-max relation for intervals
- The maximum edge biclique problem is NP-complete
- Biclique-Helly graphs
- Algorithm Theory - SWAT 2004
- Packing and Covering of the Complete Graph with 4-Cycles*
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The biparticity of a graph
- Title not available (Why is that?)
- The NP-Completeness of Some Edge-Partition Problems
- On the decomposition ofkn into complete bipartite graphs
- Title not available (Why is that?)
- A counterexample to the Alon-Saks-Seymour conjecture and related problems
- On Independent Sets and Bicliques in Graphs
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
- On covering graphs by complete bipartite subgraphs
- Bipartite dimensions and bipartite degrees of graphs
- On the coverings of graphs
- Bipartite coverings and the chromatic number
- Title not available (Why is that?)
- On the decomposition of graphs into complete bipartite graphs
- Covering graphs with few complete bipartite subgraphs
- Minimum \(H\)-decompositions of graphs
- On complete subgraphs of different orders
- Minimum \(H\)-decompositions of graphs: edge-critical case
- Mod/Resc parsimony inference: theory and application
- The Representation of a Graph by Set Intersections
- Bicliques in graphs. I: Bounds on their number
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
- Exact exponential-time algorithms for finding bicliques
- An efficient exact algorithm for constraint bipartite vertex cover
- Approximating Clique and Biclique Problems
- Generating bicliques of a graph in lexicographic order
- On the generation of bicliques of a graph
- Consensus algorithms for the generation of all maximal bicliques
- Bipartite edge partitions and the former Alon-Saks-Seymour conjecture
- A new proof of a theorem of Graham and Pollak
- Graph decomposition of slim graphs
- Title not available (Why is that?)
- A continuous characterization of the maximum-edge biclique problem
- Inertia and biclique decompositions of joins of graphs
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
- Minimum weight \(H\)-decompositions of graphs: the bipartite case
- Eigenvalues and partitionings of the edges of a graph
- Title not available (Why is that?)
- More counterexamples to the Alon-Saks-Seymour and rank-coloring conjectures
- Arboricity and bipartite subgraph listing algorithms
- Chromatic characterization of biclique covers
- Biclique decompositions and Hermitian rank
- Covering graphs: The covering problem solved
- Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
- Impossibility of Decomposing the Complete Graph on n Points into $n - 1$ Isomorphic Complete Bipartite Graphs
- Finding maximum edge bicliques in convex bipartite graphs
- Title not available (Why is that?)
- Alternating cycle-free matchings
- Algorithms and Computation
- Bicliques and eigenvalues
- Multigraph decomposition into stars and into multistars
- The Boolean Basis Problem and How to Cover Some Polygons by Rectangles
- Covering the edges of bipartite graphs using \(K_{2,2}\) graphs
- Decomposition of product graphs into complete bipartite subgraphs
- On some multigraph decomposition problems and their computational complexity
- Efficient covering designs of the complete graph
- Title not available (Why is that?)
- On biclique covering number of the Cartesian product of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A linear algorithm for computing the multiclique cover number of a series-parallel graph
- Computation of the biclique partition number for graphs with specific blocks
- On the biclique partition of the corona and joins of graphs
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
Cited In (7)
- Chromatic characterization of biclique covers
- On problem of finding all maximal induced bicliques of hypergraph
- Degree-two Inequalities, Clique Facets, and Biperfect Graphs
- On bicliques and the second clique graph of suspensions
- A linear algorithm for computing the multiclique cover number of a series-parallel graph
- Title not available (Why is that?)
- Biclique completion problems for multicast network design
This page was built for publication: Problems and invariants connected with bicliques and multicliques of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4691855)
