Efficient enumeration of bipartite subgraphs in graphs (Q1791004)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Efficient enumeration of bipartite subgraphs in graphs
scientific article

    Statements

    Efficient enumeration of bipartite subgraphs in graphs (English)
    0 references
    0 references
    0 references
    4 October 2018
    0 references
    graph algorithms
    0 references
    subgraph enumeration
    0 references
    bipartite graphs
    0 references
    constant delay
    0 references
    binary partition method
    0 references
    degeneracy
    0 references

    Identifiers

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