AbstractIn the presence paper we investigate various structural properties fo a class of trivalent network graphs, known as Moebius graphs, and then propose an O(N) optimal routing algorithm where N is the number of nodes in the graph. We also discuss the fault-tolerance aspects of such families of graphs
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanni...
We address the problem of online route discovery for a class of graphs that can be embedded either i...
AbstractThe design of fault-tolerant routings with levelled minimum optical indices plays an importa...
AbstractIn the presence paper we investigate various structural properties fo a class of trivalent n...
We develop an optimal routing algorithm as well as establish the actual value of the diameter of the...
AbstractWe construct fault-tolerant routings for several families of graphs, including all graphs of...
Overall optimal routing is considered along with individually optimal routing for networks with node...
We propose a new family of interconnection networks that are Cayley graphs with constant node degree...
AbstractConsider a communication network or an undirected graph G in which a limited number of link ...
In this paper we study routing algorithms for one-to-one communication in multiprocessors, whose int...
AbstractWe analyze the problem of constructing a network with a given number of nodes which has a fi...
This paper studies routing vulnerability in networks modeled by chordal ring graphs. In a chordal ri...
We address the problem of online route discovery for a class of graphs that can be embedded either i...
In this paper, we consider the problem of multiple unicast sessions over a directed acyclic graph. I...
This thesis investigates the subclass of interval graphs known as indifference graphs. New optimal a...
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanni...
We address the problem of online route discovery for a class of graphs that can be embedded either i...
AbstractThe design of fault-tolerant routings with levelled minimum optical indices plays an importa...
AbstractIn the presence paper we investigate various structural properties fo a class of trivalent n...
We develop an optimal routing algorithm as well as establish the actual value of the diameter of the...
AbstractWe construct fault-tolerant routings for several families of graphs, including all graphs of...
Overall optimal routing is considered along with individually optimal routing for networks with node...
We propose a new family of interconnection networks that are Cayley graphs with constant node degree...
AbstractConsider a communication network or an undirected graph G in which a limited number of link ...
In this paper we study routing algorithms for one-to-one communication in multiprocessors, whose int...
AbstractWe analyze the problem of constructing a network with a given number of nodes which has a fi...
This paper studies routing vulnerability in networks modeled by chordal ring graphs. In a chordal ri...
We address the problem of online route discovery for a class of graphs that can be embedded either i...
In this paper, we consider the problem of multiple unicast sessions over a directed acyclic graph. I...
This thesis investigates the subclass of interval graphs known as indifference graphs. New optimal a...
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanni...
We address the problem of online route discovery for a class of graphs that can be embedded either i...
AbstractThe design of fault-tolerant routings with levelled minimum optical indices plays an importa...
DOI
Add to ORKG