Wireless protocol testing and validation supported by formal methods: a hands-on report
Journal of Systems and Software - Special issue: Software engineering education and training
Bluetooth-assisted context-awareness in educational data networks
Computers & Education
| Hi-index | 0.00 |
Many parallel processing networks can be viewed as graphs called k-ary n-cubes, whose special cases include rings, hypercubes and toruses. In this paper, combinatorial properties of k-ary n-cubes are explored. In particular, the problem of characterizing the subgraph of a given number of nodes with the maximum edge count is studied. These theoretical results are then used to compute a lower bounding function in branch-and-bound partitioning algorithms and to establish the optimality of some irregular partitions.