Node-Deletion Problems on Bipartite Graphs (Q3921261)

From MaRDI portal
Revision as of 22:02, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Node-Deletion Problems on Bipartite Graphs
scientific article

    Statements

    title
    Node-Deletion Problems on Bipartite Graphs (English)
    0 references
    author
    Mihalis Yannakakis
    0 references
    publication date
    1981
    0 references
    zbMATH Keywords
    node-deletion
    0 references
    maximum subgraph
    0 references
    bipartite graph
    0 references
    hereditary property
    0 references
    NP-complete
    0 references
    polynomial algorithm
    0 references

    Identifiers

    DOI
    10.1137/0210022
    0 references
    zbMATH DE Number
    3733965
    0 references
    OpenAlex ID
    W2141925838
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3921261&oldid=32093005"
    Powered by MediaWiki