Connectedness of Graph and Matroid by Covering-Based Rough Sets (Q3300264)

From MaRDI portal
Revision as of 04:43, 23 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
Connectedness of Graph and Matroid by Covering-Based Rough Sets
scientific article

    Statements

    title
    Connectedness of Graph and Matroid by Covering-Based Rough Sets (English)
    0 references
    author
    Hui Li
    0 references
    William Zhu
    0 references
    publication date
    28 July 2020
    0 references
    zbMATH Keywords
    covering-based rough set
    0 references
    matroid
    0 references
    graph
    0 references
    connectedness
    0 references
    granular computing
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05B35
    0 references
    05C40
    0 references
    68T37
    0 references
    zbMATH DE Number
    7225236
    0 references
    OpenAlex ID
    W2292988452
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3300264&oldid=36602732"
    Powered by MediaWiki