Finding bipartite subgraphs efficiently (Q991744): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Importer (talk | contribs)
Changed an Item
Property / arXiv ID
 
Property / arXiv ID: 0905.2527 / rank
 
Normal rank

Revision as of 18:32, 18 April 2024

scientific article
Language Label Description Also known as
English
Finding bipartite subgraphs efficiently
scientific article

    Statements

    Finding bipartite subgraphs efficiently (English)
    0 references
    0 references
    0 references
    7 September 2010
    0 references
    algorithms
    0 references
    graph algorithm
    0 references
    bipartite graph
    0 references
    extremal graph theory
    0 references

    Identifiers