Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    BIT 30 (1990), S. 245-256 
    ISSN: 1572-9125
    Keywords: C.1.2 ; G.2.2 ; Boolean cube ; graphs ; embedding of graphs ; interconnection networks ; mesh of trees ; tree of meshes
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, we characterize a class of graphs which can be embedded on a boolean cube. Some of the graphs in this class are identified with the well known graphs such asmulti-dimensional mesh of trees, tree of meshes, etc. We suggest (i) an embedding of anr-dimensional mesh of trees ofn r (r+1)−rn r−1 nodes on a boolean cube of (2n) r nodes, and (ii) an embedding of a tree of meshes with 2n 2 logn+n 2 nodes on a boolean cube withn 2 exp2 (log (2 logn+1)]) nodes.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...