One-to-many node-disjoint paths in \((n,k)\)-star graphs
type: Item
instance of: scholarly article
title: One-to-many node-disjoint paths in \((n,k)\)-star graphs
zbMATH Open document ID: 1226.05239
author: Yonghong Xiang
author: Iain Stewart
published in: Discrete Applied Mathematics
publication date: 2010-05-05T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 5703708
zbMATH Keywords: interconnection networks
zbMATH Keywords: \((n,k)\)-star graphs
zbMATH Keywords: one-to-many node-disjoint paths
MaRDI profile type: Publication
full work available at URL: j.dam.2009.08.013
OpenAlex ID: W2118797705
cites work: Generalized Hypercube and Hyperbus Structures for a Computer Network
cites work: Q4830805
cites work: The \((n,k)\)-star graph: A generalized star graph
cites work: TOPOLOGICAL PROPERTIES OF THE (n,k)-STAR GRAPH
cites work: From Hall's matching theorem to optimal routing on hypercubes
cites work: Q4321476
cites work: Node-to-set disjoint paths problem in star graphs
cites work: Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
cites work: THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
cites work: Constructing one-to-many disjoint paths in folded hypercubes
cites work: Fault-tolerant routing in circulant networks and cycle prefix networks
cites work: Constructing vertex-disjoint paths in \((n, k)\)-star graphs
cites work: Computing and Combinatorics
cites work: Efficient dispersal of information for security, load balancing, and fault tolerance
DOI: 10.1016/J.DAM.2009.08.013
description: scientific article; zbMATH DE number 5703708