Minimum connected dominating sets and maximal independent sets in unit disk graphs (Q818109): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Hongwei David Du / rank
 
Normal rank
Property / author
 
Property / author: Xiao-Hua Jia / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2005.08.037 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093381928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving construction for connected dominating set with Steiner tree in wireless sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy approximation for minimum connected dominating sets / rank
 
Normal rank

Latest revision as of 12:27, 24 June 2024

scientific article
Language Label Description Also known as
English
Minimum connected dominating sets and maximal independent sets in unit disk graphs
scientific article

    Statements

    Minimum connected dominating sets and maximal independent sets in unit disk graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 March 2006
    0 references
    connected dominating set
    0 references
    independent set
    0 references
    unit disk graphs
    0 references

    Identifiers