Node-disjoint paths in a level block of generalized hierarchical completely connected networks

DOI10.1016/J.TCS.2012.09.016zbMATH Open1253.68035OpenAlexW1973018026MaRDI QIDQ1929239FDOQ1929239

Authors: Toshinori Takabatake, Tomoki Nakamigawa 

Publication date: 7 January 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.09.016

Recommendations

• Nature of singularity formed by the gravitational collapse in Husain space-time with electromagnetic field and scalar field
• NATURE OF THE SINGULARITIES IN HIGHER-DIMENSIONAL HUSAIN SPACE–TIME
• SPHERICAL AND NON-SPHERICAL GRAVITATIONAL COLLAPSE IN HUSAIN SPACETIME
• Gravitational collapse in higher dimensional space-time
• Naked singularities in higher dimensional inhomogeneous dust collapse

zbMATH Keywords

containernode-disjoint pathsfault toleranceinterconnection networksHCC

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The super connectivity of exchanged hypercubes
• Node-disjoint paths in hierarchical hypercube networks
• Title not available (Why is that?)
• Graph theory and interconnection networks.
• Short containers in Cayley graphs
• Embedding longest fault-free paths onto star graphs with more vertex faults
• Longest fault-free paths in star graphs with vertex faults
• An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes
• Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems
• Fault tolerance properties of pyramid networks
• Node‐disjoint paths and related problems on hierarchical cubic networks
• Wide diameter and minimum length of disjoint Menger path systems
• An Inherently Stabilizing Algorithm for Node-To-Node Routing over All Shortest Node-Disjoint Paths in Hypercube Networks

Cited In (3)

• A class of hierarchical graphs as topologies for interconnection networks
• Nature of singularity formed by the gravitational collapse in Husain space-time with electromagnetic field and scalar field
• Node-disjoint paths in hierarchical hypercube networks

This page was built for publication: Node-disjoint paths in a level block of generalized hierarchical completely connected networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1929239)