Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs (Q837173): 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.1016/j.tcs.2009.05.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977769214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-connected graphs with small 2-connected dominating sets. / 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: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diversity of domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: On connected \(k\)-domination numbers of graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance paired domination numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on the \(k\)-domination number and the \(k\)-tuple domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem / 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: Q3568754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-tuple domination number revisited / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:37, 1 July 2024

scientific article
Language Label Description Also known as
English
Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs
scientific article

    Statements

    Identifiers