Roger Labahn  Home/Search
Context Related
| math.unirostock.de/pub/memb...mbg.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: fermivista.math....unirostock.de (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We describe the construction of a minimum broadcast graph with 63 vertices. The graph has 162 edges. Part of this work was done while the author visited the School of Computing Science at Simon Fraser University, Burnaby B.C. Canada. 1. Introduction Let G = (V; E) be a graph with n vertices and v 2 V be any vertex. Broadcasting is the process of disseminating an item of information generated at v to every other vertex of G where in every step or round, each vertex already knowing that... (Update)
Similar documents based on text: More All
0.4: Compound Constructions of Broadcast Networks - Dinneen, Ventura, Wilson, Zakeri (1997) (Correct)
0.2: Compounding of Gossip Graphs - Fertin, Labahn (1999) (Correct)
0.1: Quick Gossiping by Telegraphs - Labahn, Warnke (1994) (Correct)
BibTeX entry: (Update)
R. Labahn, A minimum broadcast graph on 63 vertices, Discrete Appl. Math. 53 (1994), 247--250. http://citeseer.ist.psu.edu/labahn92minimum.html More
@article{ labahn94minimum,
author = "Labahn",
title = "A Minimum Broadcast Graph on 63 Vertices",
journal = "DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science",
volume = "53",
year = "1994",
url = "citeseer.ist.psu.edu/labahn92minimum.html" }
Citations (may not include all citations):184 A survey of gossiping and broadcasting in communication netw.. (context) - Hedetniemi, Hedetniemi et al. - 1988
35 New gossips and telephones (context) - Knodel - 1975
11 Algebraic constructions of efficient broadcast networks (context) - Dinneen, Fellows et al. - 1991
9 Sparse broadcast graphs (context) - Bermond, Hell et al. - 1988
9 Constructing minimal broadcast networks (context) - Chau, Liestman - 1985
6 A census of minimum broadcast graphs (context) - Mitchell, Hedetniemi - 1980
4 Some minimum broadcast graphs (context) - Maheo, Sacle - 1991
1 Private Communication (context) - Hermanns - 1992
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.math.uni-rostock.de.html): More
Constructing Realizers of Semantic Entity Relationship Schemes - Engel, Hartmann (1995) (Correct)
Periodic Interpolation and Wavelets on Sparse Grids - Sprengel (1998) (Correct)
There is no ODC with all pages isomorphic to ... - Leck, Leck (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC