Finding bipartite subgraphs efficiently (Q991744)

From MaRDI portal
Revision as of 00:26, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Finding bipartite subgraphs efficiently
scientific article

    Statements

    title
    Finding bipartite subgraphs efficiently (English)
    0 references
    author
    Dhruv Mubayi
    0 references
    György Turán
    0 references
    publication date
    7 September 2010
    0 references
    zbMATH Keywords
    algorithms
    0 references
    graph algorithm
    0 references
    bipartite graph
    0 references
    extremal graph theory
    0 references

    Identifiers

    zbMATH DE Number
    5780795
    0 references
    OpenAlex ID
    W1979173413
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q991744&oldid=32588578"
    Powered by MediaWiki