Pages that link to "Item:Q1392535"

The following pages link to The complexity of broadcasting in planar and decomposable graphs (Q1392535):

Displaying 14 items.

• Broadcasting on cactus graphs (Q512890) (← links)
• The minimum broadcast time problem for several processor networks (Q672455) (← links)
• Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2 (Q685502) (← links)
• On the complexity of the shortest-path broadcast problem (Q896659) (← links)
• All-to-all broadcast problems on Cartesian product graphs (Q897889) (← links)
• Broadcasting on recursively decomposable Cayley graphs (Q1339887) (← links)
• The complexity of broadcasting in planar and decomposable graphs (Q1392535) (← links)
• The homogeneous broadcast problem in narrow and wide strips. II: Lower bounds (Q2415370) (← links)
• A linear algorithm for finding the <i>k</i>‐broadcast center of a tree (Q5191149) (← links)
• Broadcasting in weighted trees under the postal model (Q5964023) (← links)
• Data transmission in processor networks (Q6084553) (← links)
• The complexity of broadcasting in planar and decomposable graphs (Q6184371) (← links)
• A note to non-adaptive broadcasting (Q6536205) (← links)
• Finding broadcast 2-centers of a tree under the postal model (Q6585258) (← links)