A greedy approximation for minimum connected dominating sets (Q706637)

From MaRDI portal
Revision as of 20:57, 5 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q60402914, #quickstatements; #temporary_batch_1707161894653)
scientific article
Language Label Description Also known as
English
A greedy approximation for minimum connected dominating sets
scientific article

    Statements

    title
    A greedy approximation for minimum connected dominating sets (English)
    0 references
    author
    Lu Ruan
    0 references
    Hongwei David Du
    0 references
    Xiao-Hua Jia
    0 references
    Weili Wu
    0 references
    Yingshu Li
    0 references
    Ker-I. Ko
    0 references
    publication date
    9 February 2005
    0 references
    zbMATH Keywords
    Connected dominating set
    0 references
    greedy approximation
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C69
    0 references
    68W25
    0 references
    zbMATH DE Number
    2132508
    0 references
    Wikidata QID
    Q60402914
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q706637&oldid=17570297"
    Powered by MediaWiki