Parameterized Complexity of Broadcasting in Graphs (Q6496553): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Message Multicasting in Heterogeneous Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Approximation for Broadcasting in k-cycle Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms in graphs with known broadcast time of the base graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting on cactus graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublogarithmic approximation for telephone multicast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-time line broadcast networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796194 / 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: An application of simultaneous diophantine approximation in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds on Mimimum Broadcast Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting in split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On broadcasting in unicyclic graphs / 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: Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum broadcasting and personalized communication in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski's Convex Body Theorem and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Minimum-Time Broadcast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of restricted spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Dissemination in Trees / rank
 
Normal rank

Latest revision as of 13:59, 3 December 2024

scientific article; zbMATH DE number 7842222
Language Label Description Also known as
English
Parameterized Complexity of Broadcasting in Graphs
scientific article; zbMATH DE number 7842222

    Statements

    Parameterized Complexity of Broadcasting in Graphs (English)
    0 references
    0 references
    0 references
    0 references
    3 May 2024
    0 references
    0 references
    0 references
    0 references

    Identifiers