Finding maximum edge bicliques in convex bipartite graphs (Q1759663)

From MaRDI portal
Revision as of 21:32, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Finding maximum edge bicliques in convex bipartite graphs
scientific article

    Statements

    title
    Finding maximum edge bicliques in convex bipartite graphs (English)
    0 references
    author
    Doron Nussbaum
    0 references
    Shuye Pu
    0 references
    Jörg-Rüdiger Sack
    0 references
    Takeaki Uno
    0 references
    Hamid Zarrabi-Zadeh
    0 references
    published in
    Algorithmica
    0 references
    publication date
    21 November 2012
    0 references
    zbMATH Keywords
    biclique
    0 references
    convex bipartite graph
    0 references
    biconvex graph
    0 references
    bipartite permutation graph
    0 references
    cites work
    Q4877294
    0 references
    Q4198056
    0 references

    Identifiers

    zbMATH DE Number
    6109324
    0 references
    OpenAlex ID
    W2008088179
    0 references
    Wikidata QID
    Q62037433
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1759663&oldid=35309232"
    Powered by MediaWiki