skip to content
Interconnection networks Preview this item
ClosePreview this item

Interconnection networks

Author: J -C Bermond
Publisher: Amsterdam ; New York : North-Holland ; New York : Elsevier Science Pub. Co. [distributor], 1992.
Series: Topics in discrete mathematics, 5.
Edition/Format:   Print book : EnglishView all editions and formats

(not yet rated) 0 with reviews - Be the first.

More like this


Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...


Genre/Form: Aufsatzsammlung
Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: J -C Bermond
ISBN: 0444893423 9780444893420
OCLC Number: 26307806
Notes: "Reprinted from the journal Discrete applied mathematics, volume 37/38, 1992."
Includes index.
Description: 581 pages.
Contents: New (DeltaD) Graphs Discovered by Heuristic Search. Transmitting in the n -Dimensional Cube. A Survey of Integrity. Connections between Two Cycles - A New Design of Dense Processor Interconnection Networks (INs). Design and Analysis of Fault-Tolerant Multibus INs. Dense Group Networks. Graphs with Small Diameter After Edge Deletion. New Methods for Using Cayley Graphs in INs. Stirling Networks: A Versatile Combinatorial Topology for Multiprocessor Systems. The Forwarding Index of Communication Networks with Given Connectivity. Examples of Products Giving Large Graphs with Given Degree and Diameter. Connectivity of Consecutive- d Digraphs. Generalized Degrees and Menger Path Systems. A New Look at the de Bruijn Graph. Connectivity, Persistence and Fault Diagnosis of INs based on Ok and 2 Ok Graphs. Graphs on Alphabets as Models for Large INs. Analysis of Minimal Path Routing Schemes in the Presence of Faults. Changing and Unchanging the Diameter of a Hypercube. The Connectivity of Hierarchical Cayley Digraphs. Perfect Latin Squares. Forwarding Indices of k -Connected Graphs. Broadcasting and Spanning trees in the de Bruijn and Kautz Networks. Nonblocking Self-Routing Switching networks. An Improved Upper Bound for the Subarray Partial Concentrators. Diameters of Cubic Graphs. Some Large Trivalent Graphs having Small Diameters. Cost-Performance Tradeoffs for INs. Broadcasting in DMA-Bound Bounded Degree Graphs. Minimum Broadcast Digraphs. Asymptotically-Tight Bounds on the Number of Cycles in Generalized de Bruijn-Good Graphs. The Asymptotic Optimality of Spider-Web Networks. Heuristics for the Steiner Problem in Graphs. Product Shuffle-Networks: Towards Reconciling Shuffles and Butterflies. Generating the States of a Binary Stochastic System. The Covering Radius of Hadamard Codes in Odd Graphs. Super Edge-Connectivity of Dense Digraphs and Graphs. The Underlying Graphs of a Line Digraph. Efficient Fault-Tolerant Fixed Routing on (k+1)-Connected Digraphs. Application of Coding Theory to INs. Chordal Rings as Fault-Tolerant Loops. Tables of Large ( ,D)-Graphs. Author Index.
Series Title: Topics in discrete mathematics, 5.
Responsibility: [edited by] J.-C. Bermond.
More information:


User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...


Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data

Primary Entity

<> # Interconnection networks
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "26307806" ;
   library:placeOfPublication <> ; # Amsterdam
   library:placeOfPublication <> ;
   library:placeOfPublication <> ; # New York
   schema:about <> ;
   schema:about <> ; # Verteiltes System
   schema:about <> ; # Combinatorial mathematics
   schema:about <> ; # Graph theory
   schema:about <> ; # Algorithmus
   schema:about <> ; # Aufsatzsammlung
   schema:about <> ; # Computer networks--Mathematical models
   schema:about <> ; # Computer networks--Mathematical models
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <> ; # Jean-Claude Bermond
   schema:datePublished "1992" ;
   schema:exampleOfWork <> ;
   schema:genre "Aufsatzsammlung"@en ;
   schema:inLanguage "en" ;
   schema:isPartOf <> ; # Topics in discrete mathematics ;
   schema:name "Interconnection networks"@en ;
   schema:productID "26307806" ;
   schema:publication <> ;
   schema:publisher <> ; # Elsevier Science Pub. Co. [distributor]
   schema:publisher <> ; # North-Holland
   schema:url <> ;
   schema:workExample <> ;
   umbel:isLike <> ;
   wdrs:describedby <> ;

Related Entities

<> # New York
    a schema:Place ;
   schema:name "New York" ;

<> # Elsevier Science Pub. Co. [distributor]
    a bgn:Agent ;
   schema:name "Elsevier Science Pub. Co. [distributor]" ;

<> # Topics in discrete mathematics ;
    a bgn:PublicationSeries ;
   schema:hasPart <> ; # Interconnection networks
   schema:name "Topics in discrete mathematics ;" ;

<> # Combinatorial mathematics
    a schema:Thing ;
   schema:name "Combinatorial mathematics" ;

<> # Computer networks--Mathematical models
    a schema:Intangible ;
   schema:name "Computer networks--Mathematical models"@en ;

<> # Graph theory
    a schema:Intangible ;
   schema:name "Graph theory"@en ;

<> # Jean-Claude Bermond
    a schema:Person ;
   schema:familyName "Bermond" ;
   schema:givenName "Jean-Claude" ;
   schema:givenName "J.-C" ;
   schema:name "Jean-Claude Bermond" ;

    a schema:ProductModel ;
   schema:isbn "0444893423" ;
   schema:isbn "9780444893420" ;

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.