Unpaired Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks

@inproceedings{Park2014UnpairedMD,
  title={Unpaired Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks},
  author={Jung-Heum Park},
  year={2014}
}
An unpaired many-to-many -disjoint path cover (-DPC) of a graph  is a set of  disjoint paths joining  distinct sources and sinks in which each vertex of  is covered by a path. Here, a source can be freely matched to a sink. In this paper, we investigate unpaired many-to-many DPC's in a subclass of hpercube-like interconnection networks, called… CONTINUE READING