Construction of minimum edge-fault tolerant connected dominating set in a general graph (Q2698012): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1007/s10878-023-00989-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4318767821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polylogarithmic approximation algorithm for 2-edge-connected dominating set / 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: Connected dominating set. Theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk 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: On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Coverage in 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: Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:48, 31 July 2024

scientific article
Language Label Description Also known as
English
Construction of minimum edge-fault tolerant connected dominating set in a general graph
scientific article

    Statements

    Construction of minimum edge-fault tolerant connected dominating set in a general graph (English)
    0 references
    0 references
    0 references
    0 references
    14 April 2023
    0 references
    edge fault tolerance
    0 references
    connected dominating set
    0 references
    greedy algorithm
    0 references
    approximation ratio
    0 references

    Identifiers