Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs
From MaRDI portal
Publication:2764998
DOI10.1002/net.1033zbMath0993.94026OpenAlexW2016722709MaRDI QIDQ2764998
Pierre Fraigniaud, Joseph G. Peters
Publication date: 19 September 2002
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.1033
Extremal problems in graph theory (05C35) Applications of graph theory to circuits and networks (94C15)
Related Items (18)
Broadcasting multiple messages in the 1-in port model in optimal time ⋮ On equitable colouring of Knödel graphs ⋮ Optimal odd gossiping ⋮ Maximum subgraph problem for 3-regular Knödel graphs and its wirelength ⋮ Diameter of General Knödel Graphs ⋮ 2-power domination number for Knödel graphs and its application in communication networks ⋮ The epistemic gossip problem ⋮ Upper bounds on the broadcast function using minimum dominating sets ⋮ A survey on Knödel graphs. ⋮ Domination in 4-regular Knödel graphs ⋮ Odd gossiping ⋮ Faster gossiping on butterfly networks ⋮ The shortest path problem in the Knödel graph ⋮ New bounds on the minimum number of calls in failure‐tolerant gossiping ⋮ Sparse hypercube -- a minimal \(k\)-line broadcast graph. ⋮ On the structure of minimum broadcast digraphs ⋮ Hierarchical broadcast and gossip networks ⋮ Total domination in cubic Knodel graphs
Cites Work
- Finding the roots of a polynomial on an MIMD multicomputer
- Further gossip problems
- New gossips and telephones
- Packet routing in fixed-connection networks: A survey
- Methods and problems of communication in usual networks
- Some minimum broadcast graphs
- Gossips and telephones
- A survey of gossiping and broadcasting in communication networks
- A Problem with Telephones
- Broadcasting in Bounded Degree Graphs
- Theoretical Aspects of VLSI Pin Limitations
- Antepenultimate broadcasting
- Some minimum gossip graphs
- A Cure for the Telephone Disease
This page was built for publication: Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs
