AbstractWe show that undirected Kautz graphs (Theorem 3.1) and modified Kautz graphs (Theorem 4.2) have their connectivities equal to their minimum degrees. In view of their other properties, these results show that Kautz graphs are very good fault-tolerant networks
Toeplitz networks are investigated as a source of interconnection networks. These networks possess m...
Kautz digraphs K(d,l) are a well-known family of dense digraphs, widely studied as a good model for ...
Kautz digraphs K(d,l) are a well-known family of dense digraphs, widely studied as a good model for ...
AbstractThe k-restricted edge connectivity is a more refined network reliability index than edge con...
AbstractWe consider the problem of constructing networks, having a fixed routing, that are highly fa...
In this paper we present a hardware implementation of an algorithm for generating node disjoint rout...
AbstractHypercube and Kautz network each possess certain desirable properties. However, some of the ...
Kautz directed graphs (digraphs) arise from larger de Bruijn digraphs by the deletion of nodes or fr...
In this paper we present a hardware implementation of an algorithm for generating node disjoint rout...
在Moor-Shannon网络模型中,边连通度和限制边连通度较大的网络一般有较好的可靠性和容错性.本文证明:除两种平凡情形外,无向Kautz网络的拓扑结构,无向Kautz图UK(2,n)是超级限制边连...
Abstract—The topological properties of peer-to-peer overlay networks are critical factors that domin...
AbstractAn edge cut of a connected graph is m-restricted if its removal leaves every component havin...
The topological properties of peer-to-peer overlay networks are critical factors that dominate the p...
AbstractWe construct fault-tolerant routings for several families of graphs, including all graphs of...
We propose a new family of interconnection networks that are Cayley graphs with constant node degree...
Toeplitz networks are investigated as a source of interconnection networks. These networks possess m...
Kautz digraphs K(d,l) are a well-known family of dense digraphs, widely studied as a good model for ...
Kautz digraphs K(d,l) are a well-known family of dense digraphs, widely studied as a good model for ...
AbstractThe k-restricted edge connectivity is a more refined network reliability index than edge con...
AbstractWe consider the problem of constructing networks, having a fixed routing, that are highly fa...
In this paper we present a hardware implementation of an algorithm for generating node disjoint rout...
AbstractHypercube and Kautz network each possess certain desirable properties. However, some of the ...
Kautz directed graphs (digraphs) arise from larger de Bruijn digraphs by the deletion of nodes or fr...
In this paper we present a hardware implementation of an algorithm for generating node disjoint rout...
在Moor-Shannon网络模型中,边连通度和限制边连通度较大的网络一般有较好的可靠性和容错性.本文证明:除两种平凡情形外,无向Kautz网络的拓扑结构,无向Kautz图UK(2,n)是超级限制边连...
Abstract—The topological properties of peer-to-peer overlay networks are critical factors that domin...
AbstractAn edge cut of a connected graph is m-restricted if its removal leaves every component havin...
The topological properties of peer-to-peer overlay networks are critical factors that dominate the p...
AbstractWe construct fault-tolerant routings for several families of graphs, including all graphs of...
We propose a new family of interconnection networks that are Cayley graphs with constant node degree...
Toeplitz networks are investigated as a source of interconnection networks. These networks possess m...
Kautz digraphs K(d,l) are a well-known family of dense digraphs, widely studied as a good model for ...
Kautz digraphs K(d,l) are a well-known family of dense digraphs, widely studied as a good model for ...
DOI
Add to ORKG