Induced Matching in Some Subclasses of Bipartite Graphs (Q2971661)

From MaRDI portal
Revision as of 15:23, 13 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Induced Matching in Some Subclasses of Bipartite Graphs
scientific article

    Statements

    title
    Induced Matching in Some Subclasses of Bipartite Graphs (English)
    0 references
    author
    Arti Pandey
    0 references
    B. S. Panda
    0 references
    Piyush Dane
    0 references
    Manav Kashyap
    0 references
    publication date
    7 April 2017
    0 references
    zbMATH Keywords
    matching
    0 references
    induced matching
    0 references
    bipartite graphs
    0 references
    graph algorithm
    0 references
    NP-completeness
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C70
    0 references
    05C85
    0 references
    68Q17
    0 references
    68W05
    0 references
    68W40
    0 references
    zbMATH DE Number
    6702497
    0 references
    OpenAlex ID
    W2583364872
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2971661&oldid=36314882"
    Powered by MediaWiki