Methods and problems of communication in usual networks

DOI10.1016/0166-218X(94)90180-5zbMath0818.94029OpenAlexW2080750094WikidataQ127213036 ScholiaQ127213036MaRDI QIDQ1339884

Publication date: 28 August 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)90180-5

zbMATH Keywords

scattering gossiping broadcasting processor networks multiscattering

Mathematics Subject Classification ID

Applications of graph theory (05C90) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Applications of graph theory to circuits and networks (94C15) Communication theory (94A05)

Related Items

Approximation algorithms in graphs with known broadcast time of the base graph, Broadcast graphs using new dimensional broadcast schemes for Knödel graphs, Bounds for the oriented diameter of planar triangulations, Tighter bounds on the minimum broadcast time, Gossiping in vertex-disjoint paths mode in interconnection networks, Diameter of General Knödel Graphs, Orientations of digraphs almost preserving diameter, Two edge-disjoint hamiltonian cycles in the butterfly graph, Hierarchical broadcast networks, Broadcasting in \(m\)-dimensional grid graphs with a given neighborhood template, Broadcasting in butterfly and deBruijn networks, Gossiping and broadcasting versus computing functions in networks, On edge-disjoint spanning trees with small depths, Unnamed Item, Oriented hypercubes, Effective systolic algorithms for gossiping in cycles and two-dimensional grids, On the number of broadcast schemes in networks, On the communication complexity of polling, Kernels of minimum size gossip schemes, Optimal gossiping in square 2D meshes, The complexity of finding a broadcast center, Robust gossiping with an application to consensus, An online distributed gossiping protocol for mobile networks, Connectivity of the generalized hierarchical product of graphs, Periodic gossiping in back-to-back trees, A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs, Unnamed Item, Bounded depth broadcasting, Optimal odd gossiping, Broadcast and gossip in line-communication mode, On XRAM and PRAM models, and on data-movement-intensive problems, Broadcasting in butterfly and debruijn networks, On the radius of nonsplit graphs and information dissemination in dynamic networks, Spanning subgraphs with applications to communication of a subclass of the Cayley-graph-based networks, Minimum time broadcast in faulty star networks, Broadcasting with linearly bounded transmission faults, Line broadcasting in cycles, Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks, All-to-all broadcast problem of some classes of graphs under the half duplex all-port model, Broadcasting in split graphs, On the complexity of the shortest-path broadcast problem, All-to-all broadcast problems on Cartesian product graphs, Deterministic broadcasting time with partial knowledge of the network., Messy broadcasting - decentralized broadcast schemes with limited knowledge, Optimal broadcast for fully connected processor-node networks, The logic of gossiping, Upper bounds on the broadcast function using minimum dominating sets, On optimal orientations of Cartesian products with a bipartite graph, Gossiping and broadcasting versus computing functions in networks., Dynamic faults have small effect on broadcasting in hypercubes., A survey on Knödel graphs., Interval routing schemes allow broadcasting with linear message-complexity, On linear-time data dissemination in dynamic rooted trees, The worst case behavior of randomized gossip protocols, A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem, Parsimonious flooding in dynamic graphs, Rooted level-disjoint partitions of Cartesian products, Domination in 4-regular Knödel graphs, Optimal broadcasting in the back to back d-ary trees, Fast gossiping by short messages, Odd gossiping, Efficient broadcast trees for weighted vertices, Minimum multiple originator broadcast graphs, Concurrent multicast in weighted networks, Broadcasting in DMA-bound bounded degree graphs, On the spectra of hypertrees, Broadcasting from multiple originators, Lower bounds on systolic gossip, Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs, k-Broadcasting in trees, Multiple Routing Strategies in a Labelled Network, A note on line broadcast in digraphs under the edge-disjoint paths mode, Independent spanning trees with small depths in iterated line digraphs, How to meet asynchronously at polynomial cost, Concurrent multicast in weighted networks, Gossiping in chordal rings under the line model, Communication in the two-way listen-in vertex-disjoint paths mode, The shortest path problem in the Knödel graph, Deterministic Models of Communication Faults, New bounds on the minimum number of calls in failure‐tolerant gossiping, A linear algorithm for finding the k‐broadcast center of a tree, Communication complexity of gossiping by packets, Modelling simultaneous broadcasting by level-disjoint partitions, Broadcasting in weighted trees under the postal model, The hierarchical product of graphs, Nonadaptive broadcasting in trees, Sparse hypercube -- a minimal \(k\)-line broadcast graph., Optimal sequential gossiping by short messages, Communication complexity of fault-tolerant information diffusion, On broadcasting in unicyclic graphs, Asynchronous Broadcasting with Bivalent Beeps, Time-Efficient Broadcast in Radio Networks, Optimal gossiping in paths and cycles, Minimizing broadcast costs under edge reductions in tree networks, AT-free graphs: Linear bounds for the oriented diameter, Efficient collective communciation in optical networks, Cayley graphs as classifiers for data mining: the influence of asymmetries, Symmetric flows and broadcasting in hypercubes, Compound constructions of broadcast networks, FAST BROADCASTING WITH BYZANTINE FAULTS, TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION, Broadcasting in hypercubes and star graphs with dynamic faults., Lower and upper bounds for minimum energy broadcast and sensing problems in sensor networks†, Verifiable broadcasting and gossiping in communication networks, Hierarchical broadcast and gossip networks

Cites Work