Upper bounds on the broadcast function using minimum dominating sets (Q456886): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 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.disc.2012.06.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2135113048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3136877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3277097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on the Dimensionality of Modified Knödel Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse broadcast graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a theory of domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compound constructions of broadcast networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on Knödel graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods and problems of communication in usual networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3633752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds on Mimimum Broadcast Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum multiple message broadcast graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Vertex Addition Method for Broadcast Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: More broadcast graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper and lower bounds fork-broadcasting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the monotonicity of the broadcast function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3418608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum path problem in Knödel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of gossiping and broadcasting in communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete rotations in Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4870160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance. / rank
 
Normal rank
Property / cites work
 
Property / cites work: New gossips and telephones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimum broadcast graph on 63 vertices / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:18, 5 July 2024

scientific article
Language Label Description Also known as
English
Upper bounds on the broadcast function using minimum dominating sets
scientific article

    Statements

    Upper bounds on the broadcast function using minimum dominating sets (English)
    0 references
    16 October 2012
    0 references
    domination
    0 references
    domatic number
    0 references
    broadcast function
    0 references
    Knödel graph
    0 references

    Identifiers