scientific article
From MaRDI portal
Publication:3827949
zbMath0673.94027MaRDI QIDQ3827949
Jean-Claude Bermond, Claudine Peyrat
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
communication networksgraphsinterconnection networksvertexsparse networksde Bruijn and Kautz networksinformation dissemination process
Related Items (19)
Algorithms for the fixed linear crossing number problem ⋮ Containment of butterflies in networks constructed by the line digraph operation ⋮ Bounded-call broadcasting ⋮ Methods and problems of communication in usual networks ⋮ Broadcasting in butterfly and deBruijn networks ⋮ Broadcast time and connectivity ⋮ Note on optimal gossiping in some weak-connected graphs ⋮ On the \(k\)-tuple domination of de Bruijn and Kautz digraphs ⋮ Super line-connectivity of consecutive-\(d\) digraphs ⋮ Broadcasting in butterfly and debruijn networks ⋮ Broadcasting in cycle prefix digraphs ⋮ Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks ⋮ Hamilton circuits in the directed wrapped Butterfly network ⋮ The minimum broadcast time problem for several processor networks ⋮ Broadcasting and spanning trees in de Bruijn and Kautz networks ⋮ Broadcasting in DMA-bound bounded degree graphs ⋮ On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs ⋮ Counting closed walks in generalized de Bruijn graphs ⋮ Graph theoretical issues in computer networks
This page was built for publication:
