k-Broadcasting in trees (Q2764999): 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.1002/net.1034 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982676876 / 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: Tight Bounds on Mimimum Broadcast Networks / 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: A survey of gossiping and broadcasting in communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum \(k\)-broadcast graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal broadcasting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting in DMA-bound bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant broadcast graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:20, 3 June 2024

scientific article
Language Label Description Also known as
English
k-Broadcasting in trees
scientific article

    Statements