Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs (Q5131721): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Dual-Based Local Search for the Connected Facility Location and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequential algorithm for generating random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: $k$-Blocks: A Connectivity Invariant for Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity and tree structure in finite graphs / 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: On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving connected dominating set faster than \(2^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über n-fach zusammenhängende Eckenmengen in Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy approximation for minimum connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum connected dominating sets and maximal independent sets in unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy algorithm for the fault-tolerant connected dominating set in a general graph / rank
 
Normal rank

Revision as of 23:58, 23 July 2024

scientific article; zbMATH DE number 7271634
Language Label Description Also known as
English
Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs
scientific article; zbMATH DE number 7271634

    Statements

    Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 November 2020
    0 references
    wireless sensor network
    0 references
    connected dominating set
    0 references
    fault tolerance
    0 references
    approximation algorithm
    0 references
    0 references

    Identifiers