Maximum Edge Bicliques in Tree Convex Bipartite Graphs (Q4632202): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-59605-1_5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2619628459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the maximum edge biclique packing problem on unbalanced bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus algorithms for the generation of all maximal bicliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Bipartite and Multipartite Clique Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating bicliques of a graph in lexicographic order / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generation of bicliques of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between average case complexity and approximation complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration aspects of maximal cliques and bicliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A continuous characterization of the maximum-edge biclique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching in a convex bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Hardness Results on Feedback Vertex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex sets on restricted bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable Feedback Vertex Sets in Restricted Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted Bipartite Graphs: Comparison and Hardness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular convex bipartite graphs: feedback vertex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable connected domination for restricted bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Union Closed Tree Convex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable Connected Domination for Restricted Bipartite Graphs (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular Convex Bipartite Graphs: Feedback Vertex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding maximum edge bicliques in convex bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum edge biclique problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in Some Subclasses of Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Domination on Tree Convex Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Convex Bipartite Graphs: $\mathcal{NP}$ -Complete Domination, Hamiltonicity and Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback Vertex Sets on Tree Convex Bipartite Graphs / rank
 
Normal rank

Latest revision as of 01:26, 19 July 2024

scientific article; zbMATH DE number 7048099
Language Label Description Also known as
English
Maximum Edge Bicliques in Tree Convex Bipartite Graphs
scientific article; zbMATH DE number 7048099

    Statements

    Maximum Edge Bicliques in Tree Convex Bipartite Graphs (English)
    0 references
    0 references
    0 references
    26 April 2019
    0 references
    maximum edge biclique
    0 references
    tree-convex bipartite graphs
    0 references
    star-convex bipartite graphs
    0 references
    triad-convex bipartite graphs
    0 references
    NP-completeness
    0 references
    polynomial time
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references